Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space (2022)
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.2201.06553
Publication URI: https://arxiv.org/abs/2201.06553
Type: Preprint