All Near Neighbor GraphWithout Searching
Given a collection of n objects equipped with a distance function d(·, ·), the Nearest Neighbor Graph (NNG) consists in finding the nearest neighbor of each object in the collection. Without an index the total cost of NNG is quadratic. Using an index the cost would be sub-quadratic if the search for...
Guardado en:
| Autores principales: | Chávez, Edgar, Ludueña, Verónica, Reyes, Nora Susana, Kasián, Fernando |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/66742 http://journal.info.unlp.edu.ar/JCST/article/view/695/225 |
| Aporte de: |
Ejemplares similares
-
Approximate Nearest Neighbor Graph via Index Construction
por: Chávez, Edgar, et al.
Publicado: (2016) -
Solving All-k-Nearest Neighbor Problem without an Index
por: Chávez, Edgar, et al.
Publicado: (2019) -
Búsquedas en espacios métricos: posibles optimizaciones al Geometric Near-neighbor Access Tree
por: Herrera, Norma Edith, et al.
Publicado: (2001) -
Neighbor-locating coloring: graph operations and extremal cardinalities
por: Hernando, Carmen, et al.
Publicado: (2018) -
The neighbor-locating-chromatic number of trees and unicyclic graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2023)