Fast nearest-neighbor search algorithms
โ
V. Ramasubramanian; Kuldip K. Paliwal
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 272 KB
In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of