Sciweavers

171 search results - page 6 / 35
» Convex Sparse Matrix Factorizations
Sort
View
LATIN
2010
Springer
14 years 1 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
EUROPAR
2003
Springer
14 years 9 days ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro
CVPR
2005
IEEE
14 years 9 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 2 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
ICA
2007
Springer
14 years 1 months ago
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
In the paper we present new Alternating Least Squares (ALS) algorithms for Nonnegative Matrix Factorization (NMF) and their extensions to 3D Nonnegative Tensor Factorization (NTF) ...
Andrzej Cichocki, Rafal Zdunek, Shun-ichi Amari