Benchmark and Kolmogorov complexity of string metric for speech matrix (karan behar )


Subject: Benchmark and Kolmogorov complexity of string metric for speech matrix
From:    karan behar  <karanbehar@xxxxxxxx>
Date:    Thu, 23 Jun 2011 20:21:57 -0400
List-Archive:<http://lists.mcgill.ca/scripts/wa.exe?LIST=AUDITORY>

--00151758833cb4780a04a66a31bd Content-Type: text/plain; charset=ISO-8859-1 Greetings I am working on applying various similarity on speech sentence matrix. A good ways could be calculate the computational costs of space and time associated with each metric or by comparison with benchmark tests. Kindly advise me of any benchmarks or papers on the complexity analysis of the metrics when applied on speech data. Regards Karan --00151758833cb4780a04a66a31bd Content-Type: text/html; charset=ISO-8859-1 Greetings<br><br>I am working on applying various similarity on speech sentence matrix. A good ways could be calculate the computational costs of space and time associated with each metric or by comparison with benchmark tests. <br> <br>Kindly advise me of any benchmarks or papers on the complexity analysis of the metrics when applied on speech data. <br><br>Regards<br><br>Karan<br><br><br> --00151758833cb4780a04a66a31bd--


This message came from the mail archive
/var/www/postings/2011/
maintained by:
DAn Ellis <dpwe@ee.columbia.edu>
Electrical Engineering Dept., Columbia University