Sciweavers

217 search results - page 13 / 44
» Searching in metric spaces with user-defined and approximate...
Sort
View
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 9 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 7 months ago
On Fast Non-metric Similarity Search by Metric Access Methods
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...
Tomás Skopal
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
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...