 | Up a level |
Number of items: 1.
Elkin, Y and Kurlin, V 
ORCID: 0000-0001-5328-5351
(2023)
A New Near-linear Time Algorithm For k-Nearest Neighbor Search Using a Compressed Cover Tree.
In: International Conference on Machine Learning.