230 search results - page 7 / 46 » Data Structures for Restricted Triangular Range Searching |
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
ICALP
1999
Springer
14 years 24 days ago
1999
Springer
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...