282 citations · 955 across the 31 of their papers we have counts for
5 papers · 1 filter
Parallel Tensor Compression for Large-Scale Scientific Data
Woody Austin, Grey Ballard, Tamara G. Kolda
As parallel computing trends towards the exascale, scientific data produced by high-fidelity simulations are growing increasingly massive. For instance, a simulation on a three-dim…
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…
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…
Improving the numerical stability of fast matrix multiplication
Grey Ballard, Austin R. Benson, Alex Druinsky +2
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoreti…
Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search
Grey Ballard, Ali Pinar, Tamara G. Kolda +1
Given two sets of vectors, and , our problem is to find the top- dot products, i.e., the largest among…