Up a level |
Number of items: 1.
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.
Up a level |
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.
Research Support, University of Liverpool
Sydney Jones Library, Abercromby Square
Liverpool
L69 3DA,
UK
+44 (0)151 794 0000