Sciweavers

209 search results - page 2 / 42
» t-Spanners for metric space searching
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 5 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
SPIRE
2005
Springer
13 years 10 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez

Publication
417views
14 years 1 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
SOFSEM
2007
Springer
13 years 11 months ago
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
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...
Oscar Pedreira, Nieves R. Brisaboa
ERSHOV
2009
Springer
13 years 9 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...