( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fréchet Distance for Uncertain Curves.

, , , , , и . ACM Trans. Algorithms, 19 (3): 29:1-29:47 (июля 2023)

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.

Aleksandr Kaplan

Aleksandr Karbyshev

Aleksandr Mikhalskiy

Boris Popov

Vladimir Popov

 

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

Computational Geometry (Dagstuhl Seminar 23221)., , , и . Dagstuhl Reports, 13 (5): 165-181 (2023)Fréchet Distance for Uncertain Curves., , , , , и . ACM Trans. Algorithms, 19 (3): 29:1-29:47 (июля 2023)Motivation and Practices of Teaching Computational Social Science to Undergraduate Political Science Students.. SIGCSE (2), стр. 1376. ACM, (2023)Simulating Election Votes.. SIGCSE (2), стр. 1915. ACM, (2024)Effective Use of Sparse Matrices in Problems of Mathematical Modeling., , и . UkrPROG, том 3501 из CEUR Workshop Proceedings, стр. 212-221. CEUR-WS.org, (2022)Performance and energy efficiency of the analysis of the growing synchrophasor in a high-perfomance computing environment., , , и . INDIN, стр. 1205-1210. IEEE, (2019)Computing the Fréchet Distance Between Uncertain Curves in One Dimension., , , , , и . WADS, том 12808 из Lecture Notes in Computer Science, стр. 243-257. Springer, (2021)Computing the Fréchet distance between uncertain curves in one dimension., , , , , и . Comput. Geom., (2023)Fréchet Distance for Uncertain Curves., , , , , и . ICALP, том 168 из LIPIcs, стр. 20:1-20:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping., , , , , и . SIGSPATIAL/GIS, стр. 99-110. ACM, (2020)