<--- Back to Details
First PageDocument Content
Bioinformatics / Science / Dynamic time warping / Time series analysis / Needleman–Wunsch algorithm / Sequence alignment / Smith–Waterman algorithm / Jensen–Shannon divergence / Distance matrix / Dynamic programming / Computational phylogenetics / Statistics
Date: 2013-11-14 06:55:43
Bioinformatics
Science
Dynamic time warping
Time series analysis
Needleman–Wunsch algorithm
Sequence alignment
Smith–Waterman algorithm
Jensen–Shannon divergence
Distance matrix
Dynamic programming
Computational phylogenetics
Statistics

AUTOMATIC ALIGNMENT OF MUSIC PERFORMANCES WITH STRUCTURAL DIFFERENCES Maarten Grachten1 Martin Gasser1 1 Austrian Research Institute for Artificial Intelligence (OFAI), Vienna, Austria

Add to Reading List

Source URL: www.cp.jku.at

Download Document from Source Website

File Size: 387,27 KB

Share Document on Facebook

Similar Documents

Generalizing Language Comparison  Michael Cysouw Max Planck Institute for Evolutionary Anthropology, Leipzig  The method proposed in the target article by Croft & Poole (henceforth C&P) is an

Generalizing Language Comparison Michael Cysouw Max Planck Institute for Evolutionary Anthropology, Leipzig The method proposed in the target article by Croft & Poole (henceforth C&P) is an

DocID: 1qO46 - View Document

Joint Similarity Learning for Predicting Links in Networks with Multiple-type Links Majid Yazdani Andrei Popescu-Belis

Joint Similarity Learning for Predicting Links in Networks with Multiple-type Links Majid Yazdani Andrei Popescu-Belis

DocID: 1qLRx - View Document

SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997  BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP

SIAM J. Matrix Anal. Appl. (SIMAX), 18(1):83–103, 1997 BOUNDS FOR THE COMPONENTWISE DISTANCE TO THE NEAREST SINGULAR MATRIX S. M. RUMP

DocID: 1qHdb - View Document

SIAM Review 41(1):102–112, 1999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP∗ Abstract. For a square matrix normed to 1, the normwise distance to singularity is well known to be eq

SIAM Review 41(1):102–112, 1999 ILL-CONDITIONED MATRICES ARE COMPONENTWISE NEAR TO SINGULARITY SIEGFRIED M. RUMP∗ Abstract. For a square matrix normed to 1, the normwise distance to singularity is well known to be eq

DocID: 1qB2X - View Document

Chapter 2  A Theory of Data At first glance, it would seem that we have an infinite way to collect data. Measuring the diameter of the earth by finding the distance to the horizon, measuring the height of waves

Chapter 2 A Theory of Data At first glance, it would seem that we have an infinite way to collect data. Measuring the diameter of the earth by finding the distance to the horizon, measuring the height of waves

DocID: 1qspg - View Document