281 search results - page 36 / 57 » Balancing weight-balanced trees |
HPDC
2007
IEEE
14 years 11 days ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
DAGM
2005
Springer
14 years 2 months ago
2005
Springer
The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing devi...
COORDINATION
2004
Springer
14 years 1 months ago
2004
Springer
As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The pa...
DANTE
1999
IEEE
14 years 25 days ago
1999
IEEE
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. To date, no algorithm has been published for the corresp...