Department of Computer Science, University of Liverpool, Liverpool, United Kingdom
Yury Elkin, Vitaliy Kurlin
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree