705 search results - page 49 / 141 » Proximity Cluster Trees |
GRID
2005
Springer
14 years 1 months ago
2005
Springer
Abstract— We propose a method for wide-area message passing systems to perform collective operations using dynamically created spanning trees. In our proposal, broadcasts and red...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
WSCG
2004
13 years 9 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
GMP
2008
IEEE
13 years 7 months ago
2008
IEEE
We perform collision detection between static rigid objects using a bounding volume hierarchy which consists of an oriented bounding box (OBB) tree enhanced with bounding spheres. ...
NIPS
2003
13 years 9 months ago
2003
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the -means cost; our local moves are tree...