Sciweavers

473 search results - page 49 / 95
» Using transportation distances for measuring melodic similar...
Sort
View
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 3 days ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
109
Voted
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 7 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
CICLING
2009
Springer
15 years 1 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
74
Voted
CAE
2007
15 years 2 months ago
Extracting the Essence from Sets of Images
We use a set of photographs showing similar scenes as a model for a single photograph this scene. A distance measure for this model is defined by correlating the neigborhoods of p...
Marc Alexa
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
15 years 1 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...