An unbalanced approach to metric space searching
Proximity queries (the searching problem generalized beyond exact match) is mostly modeled as metric space. A metric space consists of a collection of objects and a distance function defined among them. The goal is to preprocess the data set (a slow procedure) to quickly answer proximity queries. Th...
Guardado en:
| Autores principales: | Chávez, Edgar, Ludueña, Verónica, Reyes, Nora Susana |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21087 |
| Aporte de: |
Ejemplares similares
-
A hybrid data structure for searching in metric spaces
por: Herrera, Norma Edith, et al.
Publicado: (2004) -
Combining methods for searches in nested metric spaces
por: Gercek, Hugo, et al.
Publicado: (2011) -
A parallel search algorithm for the SAT
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2005) -
Approximate Nearest Neighbor Graph via Index Construction
por: Chávez, Edgar, et al.
Publicado: (2016) -
An efficient alternative for deletions in dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2014)