From post

Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats.

, , и . ESA, том 87 из LIPIcs, стр. 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

 

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

Computing Maximally Separated Sets in the Plane., , и . SIAM J. Comput., 36 (3): 815-834 (2006)HPRM: a hierarchical PRM., , и . ICRA, стр. 4433-4438. IEEE, (2003)Minimal Trap Design., , и . ICRA, стр. 2243-2248. IEEE, (2001)Motion planning for a steering-constrained robot through moderate obstacles., , и . STOC, стр. 343-352. ACM, (1995)Algorithms for center and Tverberg points., , и . ACM Trans. Algorithms, 5 (1): 5:1-5:20 (2008)An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles., , и . ACM Trans. Algorithms, 14 (4): 46:1-46:21 (2018)Algorithmic Techniques for Geometric Optimization., и . Computer Science Today, том 1000 из Lecture Notes in Computer Science, Springer, (1995)Efficient Sensor Placement for Surveillance Problems., , и . DCOSS, том 5516 из Lecture Notes in Computer Science, стр. 301-314. Springer, (2009)Dynamic Half-Space Range Reporting and Its Applications., и . Algorithmica, 13 (4): 325-345 (1995)k-Means Projective Clustering., и . PODS, стр. 155-165. ACM, (2004)