Sciweavers

437 search results - page 29 / 88
» Randomized Lattice Decoding
Sort
View
FCT
1991
Springer
15 years 3 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
DAGSTUHL
2006
15 years 1 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
COLING
2008
15 years 1 months ago
Syntactic Reordering Integrated with Phrase-Based SMT
We present a novel approach to word reordering which successfully integrates syntactic structural knowledge with phrase-based SMT. This is done by constructing a lattice of altern...
Jakob Elming
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 11 months ago
Probabilistic Analysis of Linear Programming Decoding
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
Constantinos Daskalakis, Alexandros G. Dimakis, Ri...
ICASSP
2011
IEEE
14 years 3 months ago
Quantizer design with mismatched side information at the decoder
Quantizer design for lossy compression with mismatched side information (SI) at the decoder is investigated. The statistical dependency between the source and SI is assumed to be ...
Sepideh Shamaei, Mehrdad Valipour