416 search results - page 24 / 84 » A Paradigm for Parallel Matrix Algorithms: |
113
click to vote
NIPS
2007
15 years 5 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
116
click to vote
ISPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
202
click to vote
PARLE
1994
15 years 7 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
110
click to vote
CONCURRENCY
2007
15 years 4 months ago
2007
We propose in this paper a distributed packed storage format that exploits the symmetry or the triangular structure of a dense matrix. This format stores only half of the matrix w...
138
click to vote
SAINT
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents a case study to effectively run a parallel branch and bound application on the Grid. The application discussed in this paper is a fine-grain application and is...