📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A New Near-linear Time Algorithm For k-Nearest Neighbor Search Using a Compressed Cover Tree (2023)

First Author: Elkin Y.

Attributed to: Inverse design of periodic crystals funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Type: Other

Volume: 202

Parent Publication: Proceedings of Machine Learning Research

ISSN: 26403498