Antonio Mesa

Aloupis, G., and others 1 Algorithms for Computing Geometric Measures of Melodic Similarity (2008)

Greg Aloupis, Thomas Fevens, Antonio Mesa, Yurai Nuñez, Stefan Langerman, Tomomi Matsui, ...

We have all heard numerous melodies, whether they come from commercial jingles, jazz ballads, operatic aria, or any of a variety of different sources. How a human detects similarities in melodies has...

z (2008)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa

Rappaport k Godfried Toussaint \Lambda Abstract Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle \Theta. We wish to rigidly move one chain so...

z (2007)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Godfried Toussaint

Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle . We wish to rigidly move one chain so that the total area between the two chains is minimized....

Algorithms for Computing Geometric Measures of Melodic Similarity ∗ (2004)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, ...

Consider two orthogonal closed chains on a cylinder. These chains are monotone with respect to the tangential Θ direction. We wish to rigidly move one chain so that the total area between the two is...

Computing a geometric measure of the similarity between two melodies (2003)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, ...

Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle Θ. We wish to rigidly move one chain so that the total area between the two chains is...

Computing a Geometric Measure of the Similarity between two Melodies (2003)

Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nunez, ...

Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle . We wish to rigidly move one chain so that the total area between the two chains is minimized....

L.: Exact Rooted Subtree Matching in Sublinear Time (2001)

Antonio Mesa, Enriquez Pablo, Olivares Rieumont, Linda Pagli, Fabrizio Luccio, Fabrizio Luccio, ...

The problem of exact subtree matching is the one of deciding if a pattern tree P of m vertices is a subtree of a text tree T of n vertices, m n, and, in the affirmative case, finding all the...

Simple Polygons with an Infinite Sequence of Deflations (2001)

Thomas Fevens, Antonio Hernandez, Antonio Mesa, Patrick Morin, Michael Soss

Given a simple polygon in the plane, a deflation is defined as the inverse of a flip in the Erdos-Nagy sense. In 1993 Bernd Wegner conjectured that every simple polygon admits only a finite number of...