Sciweavers

TIT
2010
300views Education» more  TIT 2010»
13 years 17 hour ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
TIT
2010
174views Education» more  TIT 2010»
13 years 18 hour ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...
TIT
2010
173views Education» more  TIT 2010»
13 years 18 hour ago
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's...
Peng-Jun Wan, Chih-Wei Yi, Lixin Wang
TIT
2010
171views Education» more  TIT 2010»
13 years 18 hour ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin
TIT
2010
170views Education» more  TIT 2010»
13 years 17 hour ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
Education
Top of PageReset Settings