Sciweavers

437 search results - page 15 / 88
» Randomized Lattice Decoding
Sort
View
91
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Model-based sparsity projection pursuit for lattice vector quantization
In this work we present an efficient coding scheme suitable for lossy image compression using a lattice vector quantizer (LVQ) based on statistically independent data projections...
Leonardo H. Fonteles, Marc Antonini, Ronald Phlypo
95
Voted
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 24 days ago
Competitive minimax universal decoding for several ensembles of random codes
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
Yaniv Akirav, Neri Merhav
90
Voted
STOC
2010
ACM
178views Algorithms» more  STOC 2010»
15 years 10 months ago
On the List-Decodability of Random Linear Codes
Venkatesan Guruswami, Johan Håstad and Swastik Ko...
ACL
2010
14 years 11 months ago
Jointly Optimizing a Two-Step Conditional Random Field Model for Machine Transliteration and Its Fast Decoding Algorithm
This paper presents a joint optimization method of a two-step conditional random field (CRF) model for machine transliteration and a fast decoding algorithm for the proposed metho...
Dong Yang, Paul R. Dixon, Sadaoki Furui
IACR
2011
141views more  IACR 2011»
14 years 14 days ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger