"Sparse Randomized Partition Trees for Nearest Neighbor Search."

Kaushik Sinha, Omid Keivani (2017)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2019-04-03

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/aistats/SinhaK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aistats/SinhaK17
Kaushik Sinha, Omid Keivani:
Sparse Randomized Partition Trees for Nearest Neighbor Search. AISTATS 2017: 681-689

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.