"A new near-linear time algorithm for k-nearest neighbor search using a ..."

Yury Elkin, Vitaliy Kurlin (2023)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2023-08-28

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icml/ElkinK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/ElkinK23
Yury Elkin, Vitaliy Kurlin:
A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. ICML 2023: 9267-9311

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.