A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces.


Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351 (2021) A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. [Preprint]

Access the full-text of this item by clicking on the Open Access link.
Item Type: Preprint
Divisions: Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science
Depositing User: Symplectic Admin
Date Deposited: 21 Mar 2024 15:17
Last Modified: 21 Mar 2024 15:17
Open Access URL: https://arxiv.org/abs/2111.15478
URI: https://livrepository.liverpool.ac.uk/id/eprint/3179797
CORE (COnnecting REpositories)