11784 search results - page 651 / 2357 » Interpolation for data structures |
196
click to vote
GIR
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
175
click to vote
ICALP
2005
Springer
16 years 23 days ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
202
click to vote
HIPC
2004
Springer
16 years 19 days ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
263
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
182
click to vote
CIKM
1994
Springer
15 years 11 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...