2 code implementations • 22 Aug 2015 • Bilegsaikhan Naidan, Leonid Boytsov, Yury Malkov, David Novak
This document covers a library for fast similarity (k-NN)search.
1 code implementation • 10 Jun 2015 • Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg
The underpinning assumption is that, for both metric and non-metric spaces, the distance between permutations is a good proxy for the distance between original points.
1 code implementation • NeurIPS 2013 • Leonid Boytsov, Bilegsaikhan Naidan
Our focus is on approximate nearest neighbor retrieval in metric and non-metric spaces.