Sciweavers

5348 search results - page 759 / 1070
» Models for the Compressible Web
Sort
View
CORR
2011
Springer
191views Education» more  CORR 2011»
15 years 2 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
Philip Schniter
TIT
2011
119views more  TIT 2011»
15 years 2 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
SIAMNUM
2010
106views more  SIAMNUM 2010»
15 years 2 months ago
Approximation of the Buckling Problem for Reissner-Mindlin Plates
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
Carlo Lovadina, David Mora, Rodolfo Rodrígu...
ICASSP
2011
IEEE
14 years 11 months ago
Cooperative spectrum sensing based on matrix rank minimization
In cognitive radio (CR) networks, multi-CR cooperation typically takes place during spectrum sensing, to cope with wireless fading effects and the hidden terminal problem. The use...
Yue Wang, Zhi Tian, Chunyan Feng
JMLR
2012
13 years 10 months ago
Universal Measurement Bounds for Structured Sparse Signal Recovery
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
Nikhil S. Rao, Ben Recht, Robert D. Nowak