Faster cover trees

Mike Izbicki, Christian R. Shelton

Abstract: The cover tree data structure speeds up exact nearest neighbor queries over arbitrary metric spaces. This paper makes cover trees even faster. In particular, we provide (1) a simpler definition of ...