most citedFast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IR2023★ 2 cited

Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement

Nico Hezel, Kai Uwe Barthel, Konstantin Schall +1

For approximate nearest neighbor search, graph-based algorithms have shown to offer the best trade-off between accuracy and search time. We propose the Dynamic Exploration Graph (D…