( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Using transportation distances for measuring melodic similarity.

, , , , и . ISMIR, (2003)

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.

Krzysztof Giannopoulos

Nikos Giannopoulos

Athanassios Giannopoulos

Ara Panosyan

Ara Panosyan

 

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

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane., , , и . Discret. Comput. Geom., 64 (3): 575-607 (2020)On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3., , и . ESA, том 8125 из Lecture Notes in Computer Science, стр. 541-552. Springer, (2013)Orthogonal Terrain Guarding is NP-complete., и . J. Comput. Geom., 10 (2): 21-44 (2019)The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension., , и . IWPEC, том 5917 из Lecture Notes in Computer Science, стр. 198-209. Springer, (2009)Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion., , , , , и . SWAT, том 3111 из Lecture Notes in Computer Science, стр. 138-149. Springer, (2004)Geometric Multicut., , , и . ICALP, том 132 из LIPIcs, стр. 9:1-9:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Finding the best shortcut in a geometric network., , и . SCG, стр. 327-335. ACM, (2005)A Pseudo-Metric for Weighted Point Sets., и . ECCV (3), том 2352 из Lecture Notes in Computer Science, стр. 715-730. Springer, (2002)On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching., , и . IWPEC, том 4169 из Lecture Notes in Computer Science, стр. 175-183. Springer, (2006)Hardness of discrepancy computation and ε-net verification in high dimension., , , и . J. Complex., 28 (2): 162-176 (2012)