11211 search results - page 447 / 2243 » Data Structures |
166
click to vote
ICALP
2005
Springer
16 years 12 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 ...
195
click to vote
HIPC
2004
Springer
16 years 8 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 ...
247
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...
169
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...
167
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...