282 citations · 955 across the 31 of their papers we have counts for
Showing 2015 · cs.DCShow all
2 papers · 2 filters
cs.DC2015★ 109 cited
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
Ariful Azad, Grey Ballard, Aydin Buluc +5
Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The s…
cs.DC2015
A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization
Ramakrishnan Kannan, Grey Ballard, Haesun Park
Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors and , for the given input matrix , such that . NMF…