Up a level |
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2022)
Counterexamples expose gaps in the proof of time complexity for cover
trees introduced in 2006.
.
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2022)
Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.
In: 2022 Topological Data Analysis and Visualization (TopoInVis), 2022-10-17 - 2022-10-17.
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2021)
Isometry Invariant Shape Recognition of Projectively Perturbed Point Clouds by the Mergegram Extending 0D Persistence.
MATHEMATICS, 9 (17).
p. 2121.
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2021)
Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence.
CoRR, abs/21.
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2022)
Paired compressed cover trees guarantee a near linear parametrized
complexity for all $k$-nearest neighbors search in an arbitrary metric space.
[Preprint]
Elkin, Yury, Liu, Di and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2020)
A fast approximate skeleton with guarantees for any cloud of points in a
Euclidean space.
In: Topology-based methods in Visualisation 2019.
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2020)
The mergegram of a dendrogram and its stability.
In: Mathematical Foundations of Computer Science.
Elkin, Yury
(2022)
A new compressed cover tree for k-nearest neighbour search and the
stable-under-noise mergegram of a point cloud.
PhD thesis, University of Liverpool.
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]
Elkin, Yury and Kurlin, Vitaliy ORCID: 0000-0001-5328-5351
(2021)
A new near-linear time algorithm for k-nearest neighbor search using a
compressed cover tree.
[Preprint]