132 search results - page 2 / 27 » Sparse Boolean Matrix Factorizations |
PARA
2004
Springer
13 years 10 months ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
ICIP
2009
IEEE
14 years 6 months ago
2009
IEEE
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes ...
JMLR
2010
13 years 3 months ago
2010
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
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...