Sciweavers

34 search results - page 4 / 7
» Interior-Point Algorithms for Linear-Programming Decoding
Sort
View
DCC
2005
IEEE
14 years 5 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 6 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
EMNLP
2011
12 years 5 months ago
Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
Yin-Wen Chang, Michael Collins
CORR
2006
Springer
115views Education» more  CORR 2006»
13 years 5 months ago
On the Block Error Probability of LP Decoding of LDPC Codes
Abstract-- In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analyti...
Ralf Koetter, Pascal O. Vontobel
NAACL
2007
13 years 7 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger