Sciweavers

132 search results - page 13 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
PPAM
2007
Springer
15 years 5 months ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
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...
Sivan Toledo, Anatoli Uchitel
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
15 years 12 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
ICIP
2008
IEEE
16 years 1 months ago
Face hallucination VIA sparse coding
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...
Jianchao Yang, Hao Tang, Yi Ma, Thomas S. Huang
86
Voted
ICCV
2005
IEEE
16 years 1 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler
ICANN
2007
Springer
15 years 5 months ago
Sparse and Transformation-Invariant Hierarchical NMF
The hierarchical non-negative matrix factorization (HNMF) is a multilayer generative network for decomposing strictly positive data into strictly positive activations and base vect...
Sven Rebhan, Julian Eggert, Horst-Michael Gro&szli...