Sciweavers

441 search results - page 6 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 1 months ago
Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
Zhilin Zhang, Bhaskar D. Rao
TIT
2010
100views Education» more  TIT 2010»
13 years 2 months ago
Theoretical and empirical results for recovery from multiple measurements
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
Ewout van den Berg, Michael P. Friedlander
APIN
2005
87views more  APIN 2005»
13 years 7 months ago
Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
Wen-Yang Lin
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