Sciweavers

251 search results - page 18 / 51
» When Is Nearest Neighbors Indexable
Sort
View
PVLDB
2010
87views more  PVLDB 2010»
13 years 6 months ago
Techniques for Similarity Searching in Multimedia Databases
Techniques for similarity searching in multimedia databases are reviewed. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, distance...
Hanan Samet
ICASSP
2011
IEEE
13 years 4 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 7 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
25
Voted
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
GIS
2008
ACM
13 years 8 months ago
Similarity-based prediction of travel times for vehicles traveling on known routes
The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date inf...
Dalia Tiesyte, Christian S. Jensen