TIT 2011 - PDF Preprint Papers

TIT 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TIT-2011 Paper

click to vote

TIT
2011

209views more TIT 2011»

Belief Propagation and LP Relaxation for Weighted Matching in General Graphs

13 years 7 months ago

Download engineering.purdue.edu

Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...

Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	209	Belief Propagation and LP Relaxation for Weighted Matching in General Graphs	claim
2	193	Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks	claim
3	169	Network Coding Theory Via Commutative Algebra	claim
4	160	Dispersion of the Gilbert-Elliott Channel	claim
5	157	Decentralized Sequential Hypothesis Testing Using Asynchronous Communication	claim
6	157	Universal and Composite Hypothesis Testing via Mismatched Divergence	claim
7	155	On Codebook Information for Interference Relay Channels With Out-of-Band Relaying	claim
8	152	Fast Exponentiation Using Split Exponents	claim
9	149	Network Coding for Computing: Cut-Set Bounds	claim
10	148	On Two-User Gaussian Multiple Access Channels With Finite Input Constellations	claim
11	144	Network Generalized Hamming Weight	claim
12	141	Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications	claim
13	140	Sequential Quantile Prediction of Time Series	claim
14	134	Estimating Heavy-Tail Exponents Through Max Self-Similarity	claim
15	132	Interference Channels With Destination Cooperation	claim
16	131	On the Hardness of Approximating the Network Coding Capacity	claim
17	131	Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine	claim
18	128	Secure Network Coding on a Wiretap Network	claim
19	127	Semiunitary Precoding for Spatially Correlated MIMO Channels	claim
20	126	The Return of the Cryptographic Boomerang	claim
21	125	Exact-Repair MDS Code Construction Using Interference Alignment	claim
22	125	Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption	claim
23	124	On the Equivalence of Two Achievable Regions for the Broadcast Channel	claim
24	123	Randomized Resource Allocation in Decentralized Wireless Networks	claim
25	121	A Channel Coding Perspective of Collaborative Filtering	claim
26	121	Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields	claim
27	121	Sum Capacity of MIMO Interference Channels in the Low Interference Regime	claim
28	120	Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices	claim
29	120	The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel	claim
30	119	Redundancy-Related Bounds for Generalized Huffman Codes	claim
31	119	Minimax Robust Quickest Change Detection	claim
32	118	Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels	claim
33	116	Convex Programming Upper Bounds on the Capacity of 2-D Constraints	claim
34	116	Approximate Characterizations for the Gaussian Source Broadcast Distortion Region	claim
35	116	On the Number of Errors Correctable with Codes on Graphs	claim
36	115	Wireless Network Information Flow: A Deterministic Approach	claim
37	113	Many-Sources Large Deviations for Max-Weight Scheduling	claim
38	113	Eigen-Inference for Energy Estimation of Multiple Sources	claim
39	113	Asymptotic Capacity and Optimal Precoding in MIMO Multi-Hop Relay Networks	claim
40	112	On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback	claim
41	111	Counting Partial Spread Functions in Eight Variables	claim
42	110	Ergodic Fading Interference Channels: Sum-Capacity and Separability	claim
43	109	On Achieving Local View Capacity Via Maximal Independent Graph Scheduling	claim
44	106	Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks	claim
45	106	Concavity of the Feasible Signal-to-Noise Ratio Region in Power Control Problems	claim
46	105	The Gaussian Many-to-One Interference Channel With Confidential Messages	claim
47	102	Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters	claim
48	101	Interference Channels With Source Cooperation	claim
49	98	Information Rates for Multiantenna Systems With Unknown Fading	claim
50	97	Error Exponents for the Gaussian Channel With Active Noisy Feedback	claim
51	93	Performance of Statistical Tests for Single-Source Detection Using Random Matrix Theory	claim
52	82	The Weights in MDS Codes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers