736 search results - page 15 / 148 » A dynamic data structure for approximate range searching |
AMC
2006
13 years 9 months ago
2006
Dynamic models of elastic structures are derived using approximations of linear three dimensional elasticity. A model for the three dimensional motion of a nonsymmetric structure ...
CORR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
VLDB
2000
ACM
14 years 14 days ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
Keyword searches are attractive because they facilitate users searching structured databases. On the other hand, tag clouds are popular for navigation and visualization purposes o...
STOC
1998
ACM
14 years 1 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...