๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Expected-Case Complexity of Approximate Nearest Neighbor Searching

โœ Scribed by Arya, Sunil; Fu, Ho-Yam Addy

Book ID
118181405
Publisher
Society for Industrial and Applied Mathematics
Year
2003
Tongue
English
Weight
255 KB
Volume
32
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast nearest-neighbor search algorithms
Fast nearest-neighbor search algorithms based on approximation-elimination search
โœ 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