A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.
Proceedings of the International Conference on Machine Learning, 2023
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.
CoRR, 2022
New compressed cover tree for k-nearest neighbor search.
CoRR, 2022
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space.
CoRR, 2022
A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces.
CoRR, 2021
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence.
CoRR, 2021
A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space.
CoRR, 2020
The Mergegram of a Dendrogram and Its Stability.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020