416 search results - page 28 / 84 » A Paradigm for Parallel Matrix Algorithms: |
172
click to vote
SIAMREV
2010
14 years 11 months ago
2010
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
174
click to vote
ICCS
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...
149
click to vote
NIPS
2004
15 years 5 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
120
click to vote
PPSC
1993
15 years 5 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
132
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
This work focuses on the development of a parallel framework method to improve the effectiveness and the efficiency of the obtained solutions by Multi-objective Evolutionary Algori...