236 search results - page 18 / 48 » Fast Sparse Matrix Multiplication |
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
SDM
2011
SIAM
12 years 10 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
JCP
2008
13 years 7 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...