"Paired compressed cover trees guarantee a near linear parametrized ..."

Yury Elkin, Vitaliy Kurlin (2022)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-01-21

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2201-06553
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2201-06553
Yury Elkin, Vitaliy Kurlin:
Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space. CoRR abs/2201.06553 (2022)

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.