6 search results - page 1 / 2 » Ramsey partitions and proximity data structures |
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
CGF
1999
13 years 4 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
CIKM
1994
Springer
13 years 8 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...
GFKL
2004
Springer
13 years 10 months ago
2004
Springer
Cluster ensembles are collections of individual solutions to a given clustering problem which are useful or necessary to consider in a wide range of applications. The R package˜c...
NIPS
2004
13 years 6 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...