5 search results - page 1 / 1 » A-Functions: A generalization of Extended Baum-Welch transfo... |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
We propose a new optimization algorithm called Generalized Baum Welch (GBW) algorithm for discriminative training on hidden Markov model (HMM). GBW is based on Lagrange relaxation...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
Constrained discriminative linear transform (CDLT) optimized with Extended Baum-Welch (EBW) has been presented in the literature as a discriminative speaker adaptation method that...
SODA
1996
ACM
13 years 6 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
MP
2006
13 years 4 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...