171 search results - page 8 / 35 » Convex Sparse Matrix Factorizations |
CORR
2002
Springer
13 years 6 months ago
2002
Springer
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
SIAMSC
2010
13 years 1 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...