Sciweavers

340 search results - page 41 / 68
» SLAM with Sparse Sensing
Sort
View
CORR
2008
Springer
197views Education» more  CORR 2008»
13 years 10 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 10 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
TWC
2011
367views more  TWC 2011»
13 years 5 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
ICCV
2009
IEEE
13 years 8 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 10 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...