Sciweavers

437 search results - page 41 / 88
» Randomized Lattice Decoding
Sort
View
79
Voted
ECCC
2010
122views more  ECCC 2010»
14 years 10 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
108
Voted
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 5 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
ICIP
2004
IEEE
16 years 1 months ago
Scalable predictive coding by nested quantization with layered side information
An efficient scalable predictive coding method is proposed for the Wyner-Ziv problem, using nested lattice quantization followed by multi-layer Slepian-Wolf coders (SWC) with laye...
Huisheng Wang, Antonio Ortega
CSL
2002
Springer
14 years 11 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
86
Voted
ICASSP
2011
IEEE
14 years 3 months ago
Variational approximation of long-span language models for lvcsr
Long-span language models that capture syntax and semantics are seldom used in the first pass of large vocabulary continuous speech recognition systems due to the prohibitive sea...
Anoop Deoras, Tomas Mikolov, Stefan Kombrink, Mart...