Sciweavers

34 search results - page 6 / 7
» Interior-Point Algorithms for Linear-Programming Decoding
Sort
View
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 3 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 7 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
GLOBECOM
2006
IEEE
14 years 27 days ago
Algorithms for Server Placement in Multiple-Description-Based Media Streaming
— Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding ...
Satyajeet Ahuja, Marwan Krunz
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 11 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICC
2008
IEEE
175views Communications» more  ICC 2008»
14 years 1 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...