From post

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.

 

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

An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.. LATIN, том 4957 из Lecture Notes in Computer Science, стр. 387-398. Springer, (2008)Debiasing social wisdom., , , и . KDD, стр. 500-508. ACM, (2013)Hashing, searching, sketching.. Stanford University, USA, (2007)Beyond bloom filters: from approximate membership checks to approximate state machines., , , , и . SIGCOMM, стр. 315-326. ACM, (2006)Sketch based Memory for Neural Networks., , и . AISTATS, том 130 из Proceedings of Machine Learning Research, стр. 3169-3177. PMLR, (2021)Clustering to minimize the sum of cluster diameters., и . STOC, стр. 1-10. ACM, (2001)Lower Bounds on Near Neighbor Search via Metric Expansion., , и . FOCS, стр. 805-814. IEEE Computer Society, (2010)Representing Graph Metrics with Fewest Edges., , , , и . STACS, том 2607 из Lecture Notes in Computer Science, стр. 355-366. Springer, (2003)Estimating Sum by Weighted Sampling., , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 53-64. Springer, (2007)On the decidability of accessibility problems (extended abstract)., , , и . STOC, стр. 306-315. ACM, (2000)