266 search results - page 34 / 54 » Sparse Numerical Semigroups |
160
Voted
NIPS
2004
15 years 3 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
141
Voted
PPSC
1997
15 years 3 months ago
1997
We present the preliminary design for a C++ template library to enable the compositional construction of matrix classes suitable for high performance numerical linear algebra comp...
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
105
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
124
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Suppose a given observation matrix can be decomposed as the sum of a low-rank matrix and a sparse matrix (outliers), and the goal is to recover these individual components from th...