Sciweavers

214 search results - page 13 / 43
» Fast Nearest Neighbor Search in High-Dimensional Space
Sort
View
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 4 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
100
Voted
SSD
2009
Springer
127views Database» more  SSD 2009»
15 years 2 months ago
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
DCC
1995
IEEE
15 years 1 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 9 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
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...
Richard Cole, Lee-Ad Gottlieb
ICALP
2004
Springer
15 years 2 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee