Bilegsaikhan Naidan

According to our database, Bilegsaikhan Naidan authored at least 9 papers between 2011 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

Engineering Efficient Similarity Search Methods.

Bilegsaikhan Naidan

PhD thesis, 2017

2015

Permutation Search Methods are Efficient, Yet Faster Search is Possible.

Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg

Proc. VLDB Endow., 2015

Non-Metric Space Library Manual.

Bilegsaikhan Naidan, Leonid Boytsov

CoRR, 2015

2014

Static-to-dynamic transformation for metric indexing structures (extended version).

Bilegsaikhan Naidan, Magnus Lie Hetland

Inf. Syst., 2014

2013

Engineering Efficient and Effective Non-metric Space Library.

Leonid Boytsov, Bilegsaikhan Naidan

Proceedings of the Similarity Search and Applications - 6th International Conference, 2013

Learning to Prune in Metric and Non-Metric Spaces.

Leonid Boytsov, Bilegsaikhan Naidan

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012

Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search.

Bilegsaikhan Naidan, Magnus Lie Hetland

Int. J. Multim. Data Eng. Manag., 2012

Static-to-Dynamic Transformation for Metric Indexing Structures.

Bilegsaikhan Naidan, Magnus Lie Hetland

Proceedings of the Similarity Search and Applications - 5th International Conference, 2012

2011

Approximate similarity search using samples.

Bilegsaikhan Naidan, Magnus Lie Hetland, Ole Edsberg

Proceedings of the Fourth International Conference on Similarity Search and Applications, 2011