Sciweavers

78 search results - page 4 / 16
» Searching in metric spaces by spatial approximation
Sort
View
SPIRE
1998
Springer
13 years 11 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
CIKM
2008
Springer
13 years 9 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 7 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
CVPR
2001
IEEE
14 years 9 months ago
Adaptive Quasiconformal Kernel Metric for Image Retrieval
This paper presents a new approach to ranking relevant images for retrieval. Distance in the feature space associated with a kernel is used to rank relevant images. An adaptive qu...
Douglas R. Heisterkamp, Jing Peng, H. K. Dai
COMPGEOM
2005
ACM
13 years 9 months ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel