74 search results - page 4 / 15 » Viterbi sequences and polytopes |
ACL
2006
13 years 8 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
CSDA
2007
13 years 7 months ago
2007
The knowledge of the state sequences that explain a given observed sequence for a known hidden Markovian model is the basis of various methods that may be divided into three categ...
MP
1998
13 years 7 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
ESANN
2000
13 years 8 months ago
2000
In this work new Decision-Feedback (DF) Neural Equalizers (DFNE) are introduced and compared with classical DF equalizers and Viterbi demodulators. It is shown that the choice of ...