( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions.

, и . Commun. ACM, 51 (1): 117-122 (2008)

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.

Sven Piotrowiak

Katja Piotrowski

Heinz Piotrowski

Berthold Piotrowski

Jens Piotraschke

 

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

Approximate Nearest Neighbor under edit distance via product metrics.. SODA, стр. 646-650. SIAM, (2004)Nearest Neighbors In High-Dimensional Spaces. Handbook of Discrete and Computational Geometry, CRC Press LLC, Boca Raton, FL, 2nd издание, (апреля 2004)Declaring independence via the sketching of sketches., и . SODA, стр. 737-745. SIAM, (2008)Inerpolation of Symmetric Functions and a New Type of Combinatorial Design.. STOC, стр. 736-740. ACM, (1999)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., и . STOC, стр. 51-58. ACM, (2015)Which Regular Expression Patterns are Hard to Match?, и . CoRR, (2015)Polylogarithmic Private Approximations and Efficient Matching., и . TCC, том 3876 из Lecture Notes in Computer Science, стр. 245-264. Springer, (2006)Efficient Computations of l1 and linfinity Rearrangement Distances., , , , и . SPIRE, том 4726 из Lecture Notes in Computer Science, стр. 39-49. Springer, (2007)A Nearly-Linear Time Framework for Graph-Structured Sparsity., , и . ICML, том 37 из JMLR Workshop and Conference Proceedings, стр. 928-937. JMLR.org, (2015)Seismic feature extraction using steiner tree methods., , , , , и . ICASSP, стр. 1647-1651. IEEE, (2015)