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

73views more TIT 2011»

Belief Propagation and LP Relaxation for Weighted Matching in General Graphs

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers