171 search results - page 17 / 35 » Convex Sparse Matrix Factorizations |
146
Voted
SIAMMAX
2010
14 years 10 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
171
click to vote
JMLR
2012
13 years 6 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
114
click to vote
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
134
Voted
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
136
Voted
ICIP
2008
IEEE
16 years 5 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...