Results 271 to 280 of about 724,897 (308)
Sparse Recovery Using Sparse Matrices [PDF]
Proceedings of the IEEE, 2010 In this paper, we survey algorithms for sparse recovery problems that are based on sparse random matrices. Such matrices has several attractive properties: they support algorithms with low computational complexity, and make it easy to perform incremental updates to signals.
Anna Gilbert, Piotr Indyk
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SC2Net: Sparse LSTMs for Sparse Coding
Proceedings of the AAAI Conference on Artificial Intelligence, 2018The iterative hard-thresholding algorithm (ISTA) is one of the most popular optimization solvers to achieve sparse codes. However, ISTA suffers from following problems: 1) ISTA employs non-adaptive updating strategy to learn the parameters on each dimension with a fixed learning rate. Such a strategy may lead to inferior performance due
Joey Tianyi Zhou +9 more
openaire +1 more source
Sparse Topical Coding with Sparse Groups
2016Learning a latent semantic representing from a large number of short text corpora makes a profound practical significance in research and engineering. However, it is difficult to use standard topic models in microblogging environments since microblogs have short length, large amount, snarled noise and irregular modality characters, which prevent topic ...
Min Peng 0002 +6 more
openaire +1 more source
Sparse Coding in Sparse Winner Networks
2007This paper investigates a mechanism for reliable generation of sparse code in a sparsely connected, hierarchical, learning memory. Activity reduction is accomplished with local competitions that suppress activities of unselected neurons so that costly global competition is avoided.
Janusz A. Starzyk +2 more
openaire +2 more sources
2009 IEEE International Conference on Acoustics, Speech and Signal Processing, 2009
We propose a boosting algorithm that seeks to minimize the AdaBoost exponential loss of a composite classifier using only a sparse set of base classifiers. The proposed algorithm is computationally efficient and in test examples produces composite classifiers that are sparser and generalize as well those produced by Adaboost.
Zhen James Xiang, Peter J. Ramadge
openaire +1 more source
We propose a boosting algorithm that seeks to minimize the AdaBoost exponential loss of a composite classifier using only a sparse set of base classifiers. The proposed algorithm is computationally efficient and in test examples produces composite classifiers that are sparser and generalize as well those produced by Adaboost.
Zhen James Xiang, Peter J. Ramadge
openaire +1 more source
International Journal of Foundations of Computer Science, 1999
PEI formalism has been designed to reason and develop parallel programs in the context of data parallelism. In this paper, we focus on the use of PEI to transform a program involving dense matrices into a new program involving sparse matrices, using the example of the matrix-vector product.
Frédérique Voisin, Guy-René Perrin
openaire +1 more source
PEI formalism has been designed to reason and develop parallel programs in the context of data parallelism. In this paper, we focus on the use of PEI to transform a program involving dense matrices into a new program involving sparse matrices, using the example of the matrix-vector product.
Frédérique Voisin, Guy-René Perrin
openaire +1 more source