Sciweavers

1200 search results - page 197 / 240
» Marked Ancestor Problems
Sort
View
EGH
2004
Springer
15 years 3 months ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...
ICALP
2010
Springer
15 years 2 months ago
Cell Probe Lower Bounds and Approximations for Range Mode
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
Mark Greve, Allan Grønlund Jørgensen...
KBSE
1995
IEEE
15 years 1 months ago
A Transformation System for Interactive Reformulation of Design Optimization Strategies
Numerical design optimization algorithms are highly sensitive to the particular formulation of the optimization problems they are given. The formulation of the search space, the o...
Thomas Ellman, John Keane, Takahiro Murata, Mark S...
ASWC
2008
Springer
14 years 12 months ago
ROC: A Method for Proto-ontology Construction by Domain Experts
Abstract. Ontology construction is a labour-intensive and costly process. Even though many formal and semi-formal vocabularies are available, creating an ontology for a specific ap...
Nicole J. J. P. Koenderink, Mark van Assem, J. Lar...
COMPGEOM
2005
ACM
14 years 12 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg