Sciweavers

441 search results - page 22 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
Adjugate pairs of sparse arrays for sampling two dimensional signals
Sparse sampling with coprime lattice arrays was introduced recently in the literature. It has been shown that a dense coarray can be constructed from such a pair of arrays, and is...
Palghat P. Vaidyanathan, Piya Pal
CORR
2007
Springer
183views Education» more  CORR 2007»
14 years 9 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
IPPS
1998
IEEE
15 years 2 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
15 years 3 months ago
Fast Sparse Matrix Multiplication
Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B usi...
Raphael Yuster, Uri Zwick
JMLR
2012
13 years 8 days ago
Multi-label Subspace Ensemble
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
Tianyi Zhou, Dacheng Tao