Sciweavers

100 search results - page 15 / 20
» Best Basis Compressed Sensing
Sort
View
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 2 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
ICPP
2007
IEEE
14 years 1 months ago
Integrating Memory Compression and Decompression with Coherence Protocols in Distributed Shared Memory Multiprocessors
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...
Lakshmana Rao Vittanala, Mainak Chaudhuri
VTC
2010
IEEE
195views Communications» more  VTC 2010»
13 years 5 months ago
Efficiency of Distributed Compression and Its Dependence on Sensor Node Deployments
Abstract--In this paper we analyze the energy-efficiency of distributed compression and its dependence on the node deployment strategies for Wireless Sensor Networks (WSNs). Reduce...
Frank Oldewurtel, Janne Riihijärvi, Petri M&a...
EWSN
2010
Springer
14 years 2 months ago
Energy-Aware Sparse Approximation Technique (EAST) for Rechargeable Wireless Sensor Networks
Due to non-homogeneous spread of sunlight, sensing nodes typically have non-uniform energy profiles in rechargeable Wireless Sensor Networks (WSNs). An energy-aware work load dist...
Rajib Kumar Rana, Wen Hu, Chun Tung Chou
TIT
2008
121views more  TIT 2008»
13 years 7 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut