3055 search results - page 222 / 611 » Randomized Search Trees |
104
click to vote
TCAD
2002
15 years 14 days ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
150
Voted
JDCTA
2010
14 years 7 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In this work we propose a probabilistic model for generic object classification from raw range images. Our approach supports a validation process in which classes are verified usi...
109
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
114
click to vote
WAIM
2007
Springer
15 years 7 months ago
2007
Springer
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...