Sciweavers

28 search results - page 1 / 6
» On sparse representations of linear operators and the approx...
Sort
View
CISS
2008
IEEE
13 years 11 months ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
ICASSP
2009
IEEE
13 years 11 months ago
Compressive sensing for sparsely excited speech signals
Compressive sensing (CS) has been proposed for signals with sparsity in a linear transform domain. We explore a signal dependent unknown linear transform, namely the impulse respo...
Thippur V. Sreenivas, W. Bastiaan Kleijn
AMAST
2008
Springer
13 years 6 months ago
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
Abstract. We present a static analysis technique for modeling and approximating the long-run resource usage of programs. The approach is based on a quantitative semantic framework ...
David Cachera, Thomas P. Jensen, Arnaud Jobin, Pas...
JMLR
2010
136views more  JMLR 2010»
12 years 11 months ago
High Dimensional Inverse Covariance Matrix Estimation via Linear Programming
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...
Ming Yuan
LCPC
1998
Springer
13 years 8 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...