416 search results - page 75 / 84 » A Paradigm for Parallel Matrix Algorithms: |
125
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
127
click to vote
SOSP
2009
ACM
15 years 7 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
SAGT
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
PPAM
2005
Springer
15 years 4 months ago
2005
Springer
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...