184 search results - page 8 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
LCN
2008
IEEE
15 years 6 months ago
2008
IEEE
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
101
click to vote
STOC
2001
ACM
15 years 12 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...
76
Voted
ICALP
1999
Springer
15 years 4 months 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...
162
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
102
click to vote
COMPGEOM
2005
ACM
15 years 1 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...