Sciweavers

441 search results - page 19 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICCS
2001
Springer
15 years 2 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
ICASSP
2011
IEEE
14 years 1 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 4 months ago
Sequential Analysis in High Dimensional Multiple Testing and Sparse Recovery
—This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is...
Matt Malloy, Robert Nowak
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 3 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 10 months ago
Estimation with Random Linear Mixing, Belief Propagation and Compressed Sensing
Abstract--We apply Guo and Wang's relaxed belief propagation (BP) method to the estimation of a random vector from linear measurements followed by a componentwise probabilisti...
Sundeep Rangan