Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

Despite the broad range of algorithms for Approximate Nearest Neighbor Search, most empirical evaluations of algorithms have focused on smaller datasets, typically of 1 million points~\citep{Benchmark}. However, deploying recent advances in embedding based techniques for search, recommendation and r...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Simhadri, Harsha Vardhan, Williams, George, Aumüller, Martin, Douze, Matthijs, Babenko, Artem, Baranchuk, Dmitry, Chen, Qi, Hosseini, Lucas, Krishnaswamy, Ravishankar, Srinivasa, Gopal, Subramanya, Suhas Jayaram, Wang, Jingdong
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Databases Computer Science - Learning Computer Science - Performance
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!