772 search results - page 6 / 155 » Hyper-Systolic Matrix Multiplication |
ICPP
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth re...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Moore’s Law suggests that the number of processing cores on a single chip increases exponentially. The future performance increases will be mainly extracted from thread-level par...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Multiplicative update algorithms have encountered a great success to solve optimization problems with non-negativity constraints, such as the famous non-negative matrix factorizat...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....