11 search results - page 1 / 3 » Online decoding of Markov models under latency constraints |
ICML
2006
IEEE
14 years 5 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...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
JVCIR
2008
13 years 4 months ago
2008
In this article we present three key ideas which together form a flexible framework for maximizing user-perceived quality under given resources with modern video codecs (H.264). F...
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...