Sciweavers

4057 search results - page 296 / 812
» Linear combination of transformations
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Non-stationary feature extraction for automatic speech recognition
In current speech recognition systems mainly Short-Time Fourier Transform based features like MFCC are applied. Dropping the short-time stationarity assumption of the voiced speec...
Zoltán Tüske, Pavel Golik, Ralf Schl&u...
TCAD
1998
114views more  TCAD 1998»
15 years 6 months ago
Behavioral optimization using the manipulation of timing constraints
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
Miodrag Potkonjak, Mani B. Srivastava
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ALT
2008
Springer
16 years 3 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
ECML
2003
Springer
15 years 11 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank