Sciweavers

186 search results - page 8 / 38
» Fast Computation of Sparse Datacubes
Sort
View
ICASSP
2011
IEEE
13 years 8 days ago
Fast adaptive variational sparse Bayesian learning with automatic relevance determination
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
Dmitriy Shutin, Thomas Buchgraber, Sanjeev R. Kulk...
ICASSP
2010
IEEE
13 years 8 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
ICASSP
2011
IEEE
13 years 8 days ago
Computationally efficient regularized acoustic imaging
Sparse recovery techniques have been shown to produce very accurate acoustic images, significantly outperforming traditional deconvolution approaches. However, so far these propo...
Flavio P. Ribeiro, Vitor H. Nascimento
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
ICCS
2009
Springer
14 years 3 months ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka