574 search results - page 36 / 115 » Robust Factorization |
PARA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
ISSAC
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
ECCV
2008
Springer
13 years 11 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
This article presents a robust EDA for global optimization with real parameters. The approach is based on the linear combination of individuals of two populations. One is the curr...
ICPR
2010
IEEE
14 years 9 days ago
2010
IEEE
Most existing performance evaluation methods concentrate on defining separate metrics over a wide range of conditions and generating standard benchmarking video sequences for exam...