6568 search results - page 19 / 1314 » Reducing the Complexity of Reductions |
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
113
click to vote
SAGA
2009
Springer
15 years 6 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
TASLP
2002
14 years 11 months ago
2002
Two approaches are proposed for the design of tied-mixture hidden Markov models (TMHMM). One approach improves parameter sharing via partial tying of TMHMM states. To facilitate ty...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...