42 search results - page 2 / 9 » Better Size Estimation for Sparse Matrix Products |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
HPCN
1997
Springer
13 years 9 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
CCECE
2006
IEEE
13 years 9 months ago
2006
IEEE
This paper presents a forgetting factor scheme for variable step-size affine projection algorithms (APA). The proposed scheme uses a forgetting processed input matrix as the projec...
PR
2008
13 years 5 months ago
2008
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
ICDM
2010
IEEE
13 years 3 months ago
2010
IEEE
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...