HENN constructs hierarchical nearest-neighbor graphs with epsilon-net layers, claiming polylogarithmic query time and showing speedups over HNSW on skewed data.
Cover trees for nearest neighbor
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
HENN constructs hierarchical nearest-neighbor graphs with epsilon-net layers, claiming polylogarithmic query time and showing speedups over HNSW on skewed data.