An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time (Q2327126)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time |
scientific article |
Statements
An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time (English)
0 references
11 October 2019
0 references
computation geometry
0 references
approximate nearest neighbor
0 references
reduction
0 references
