Sciweavers

165 search results - page 8 / 33
» Computing a Nearest Correlation Matrix with Factor Structure
Sort
View
EUROPAR
2009
Springer
14 years 10 days ago
Two-Dimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Based on Their Functional Performance Mod
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
Alexey L. Lastovetsky, Ravi Reddy
FOCS
2008
IEEE
13 years 7 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
PARA
2004
Springer
14 years 1 months ago
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
José R. Herrero, Juan J. Navarro
ICIP
2000
IEEE
14 years 9 months ago
Weighted Factorization
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
Pedro M. Q. Aguiar, José M. F. Moura
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