An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time

DOI10.1007/978-3-030-04651-4_31OpenAlexW2892992647MaRDI QIDQ2327126

Jian-Zhong Li, Hengzhao Ma

Publication date: 11 October 2019

Full work available at URL: https://arxiv.org/abs/1809.09776

zbMATH Keywords

reductionapproximate nearest neighborcomputation geometry

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee

This page was built for publication: An algorithm for reducing approximate nearest neighbor to approximate near neighbor with \(O(\log{n})\) query time