A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree (2021)
Attributed to:
Application driven Topological Data Analysis
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.2111.15478
Publication URI: https://arxiv.org/abs/2111.15478
Type: Preprint