921 search results - page 34 / 185 » New Data Structures for Orthogonal Range Searching |
124
click to vote
ISCA
2008
IEEE
15 years 3 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
142
click to vote
CIKM
1998
Springer
15 years 8 months ago
1998
Springer
We present a new approach to extracting information from unstructured documents based on an application ontology that describes a domain of interest. Starting with such an ontolog...
120
click to vote
VISUALIZATION
1997
IEEE
15 years 8 months ago
1997
IEEE
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
141
click to vote
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
109
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...