"A new compressed cover tree guarantees a near linear parameterized ..."

Yury Elkin, Vitaliy Kurlin (2021)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2021-12-02

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2111-15478
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2111-15478
Yury Elkin, Vitaliy Kurlin:
A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. CoRR abs/2111.15478 (2021)

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.