( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms.

, , и . Inf. Syst., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Willi Aumüller

Josef Aumüller

Christian Aumüller

Ellen Aumüller

Peter Aumüller

 

Другие публикации лиц с тем же именем

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths., , , , и . Comb. Probab. Comput., 28 (4): 485-518 (2019)Distance-Sensitive Hashing., , , и . PODS, стр. 89-104. ACM, (2018)ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms., , и . SISAP, том 10609 из Lecture Notes in Computer Science, стр. 34-49. Springer, (2017)Parameter-free Locality Sensitive Hashing for Spherical Range Reporting., , и . SODA, стр. 239-256. SIAM, (2017)DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search., , и . CoRR, (2021)Fair Near Neighbor Search: Independent Range Sampling in High Dimensions., , и . PODS, стр. 191-204. ACM, (2020)Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All?, , , , и . CoRR, (2021)Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search., , , , , , , , , и 2 other автор(ы). CoRR, (2022)The role of local dimensionality measures in benchmarking nearest neighbor search., и . Inf. Syst., (2021)Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme., и . CoRR, (2018)