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

A note on Rabin's nearest-neighbor algorithm

โœ Scribed by Steve Fortune; John Hopcroft


Book ID
113162094
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
421 KB
Volume
8
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A fast nearest neighbor search algorithm
โœ Sung-Hyuk Cha; Sargur N. Srihari ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this namK ve method is O(nd) where n is the num