33 search results - page 1 / 7 » On the Scalability of Hypergraph Models for Sparse Matrix Pa... |
PDP
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
JPDC
2008
13 years 4 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
SIAMSC
2010
12 years 11 months ago
2010
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
PARA
1995
Springer
13 years 8 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...