Search Results for author:
Found 1 papers, 1 papers with code
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
In particular, our new routing methods enable the use of balanced graph partitioning, which is a high-quality partitioning method without a naturally associated routing algorithm.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
