455 search results - page 46 / 91 » On Trees and Noncrossing Partitions |
163
click to vote
PDPTA
2003
15 years 7 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
191
click to vote
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
155
click to vote
TSP
2010
15 years 29 days ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
194
click to vote
EGPGV
2004
Springer
15 years 11 months ago
2004
Springer
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
159
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...