Sciweavers

441 search results - page 26 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ECML
2007
Springer
15 years 4 months ago
Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
The stability of sample based algorithms is a concept commonly used for parameter tuning and validity assessment. In this paper we focus on two well studied algorithms, LSI and PCA...
Dimitrios Mavroeidis, Michalis Vazirgiannis
AMC
2005
87views more  AMC 2005»
14 years 9 months ago
Wavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
B. V. Rathish Kumar, Mani Mehra
NIPS
2004
14 years 11 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
ICASSP
2011
IEEE
14 years 1 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes
ICIP
2008
IEEE
15 years 4 months ago
Compressed sensing for multi-view tracking and 3-D voxel reconstruction
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
Dikpal Reddy, Aswin C. Sankaranarayanan, Volkan Ce...