Sciweavers

78 search results - page 6 / 16
» Searching in metric spaces by spatial approximation
Sort
View
ISM
2006
IEEE
138views Multimedia» more  ISM 2006»
13 years 7 months ago
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
Nieves R. Brisaboa, Antonio Fariña, Oscar P...
GIS
2010
ACM
13 years 6 months ago
Supporting location-based approximate-keyword queries
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
Sattam Alsubaiee, Alexander Behm, Chen Li
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 8 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
NIPS
2004
13 years 8 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...