Sciweavers

122 search results - page 25 / 25
» The approximability of the String Barcoding problem
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 9 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ICML
2008
IEEE
14 years 5 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...