11212 search results - page 358 / 2243 » Semi-persistent Data Structures |
167
click to vote
ICDM
2005
IEEE
16 years 9 days ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
239
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...
162
click to vote
CIKM
1994
Springer
15 years 10 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...
161
click to vote
COMPGEOM
1994
ACM
15 years 10 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...
163
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...