From b3ba1ad525ea0765b1effe5058bc8213442da116 Mon Sep 17 00:00:00 2001 From: Yong Yuan Date: Sun, 21 Jul 2019 19:45:58 +0800 Subject: [PATCH] add paper: Learning to Route in Similarity Graphs --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index 7efff04..a3fe62d 100644 --- a/README.md +++ b/README.md @@ -74,6 +74,7 @@ #### ANN search +- [Learning to Route in Similarity Graphs](https://arxiv.org/abs/1905.10987), ICML 2019. - [Practical and Optimal LSH for Angular Distance](chrome-extension://ikhdkkncnoglghljlkmcimlnlhkeamad/pdf-viewer/web/viewer.html?file=http%3A%2F%2Fpapers.nips.cc%2Fpaper%2F5893-practical-and-optimal-lsh-for-angular-distance.pdf) - [pq-fast-scan](https://github.com/technicolor-research/pq-fast-scan) - [faiss](https://github.com/facebookresearch/faiss). A library for efficient similarity search and clustering of dense vectors.