Sciweavers

756 search results - page 42 / 152
» Quantization of Sparse Representations
Sort
View
NIPS
2007
13 years 9 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
CIKM
2010
Springer
13 years 6 months ago
Novel local features with hybrid sampling technique for image retrieval
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
Leszek Kaliciak, Dawei Song, Nirmalie Wiratunga, J...
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 7 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ECCV
2010
Springer
13 years 8 months ago
Tensor Sparse Coding for Region Covariances
Sparse representation of signals has been the focus of much research in the recent years. A vast majority of existing algorithms deal with vectors, and higher
Ravishankar Sivalingam, Daniel Boley, Vassilios Mo...
CAP
2010
13 years 2 months ago
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
Mickaël Gastineau