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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2018-04-01
|
| Series: | Journal of Computer Science and Technology |
| Subjects: | |
| Online Access: | http://journal.info.unlp.edu.ar/JCST/article/view/695 |