Parallel Triangle Counting and Enumeration using Matrix Algebra Ariful Azad1 , Aydın Buluc¸1 , John Gilbert2 E-mail: , , and 1 Lawrence

First Page		Document Content
Date: 2015-05-18 17:48:42 Mathematics Algebra Linear algebra Numerical linear algebra Matrix Adjacency matrix Maximal independent set Algorithm Sparse matrix Basic Linear Algebra Subprograms Bloom filter Matching		Parallel Triangle Counting and Enumeration using Matrix Algebra Ariful Azad1 , Aydın Buluc¸1 , John Gilbert2 E-mail: , , and 1 Lawrence Add to Reading List Source URL: gauss.cs.ucsb.edu Download Document from Source Website File Size: 384,43 KB Share Document on Facebook

	2018 IEEE International Symposium on High Performance Computer Architecture OuterSPACE: An Outer Product based Sparse Matrix Multiplication Accelerator Subhankar Pal∗ Jonathan Beaumont∗ Dong-Hyeon Park∗ Aporva Ama DocID: 1uUeI - View Document
	0 Autotuning Runtime Specialization for Sparse Matrix-Vector Multiplication BUSE YILMAZ, Ozyegin University BARIS ¸ AKTEMUR, Ozyegin University DocID: 1uMPm - View Document
	Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C DocID: 1uzWI - View Document
	EFFICIENT SPARSE MATRIX PROCESSING FOR NILM NILM Workshop 2014 Stephen Makonin, PhD Candidate, ISP, smIEEE! June 3,1 2014 DocID: 1uf4G - View Document
	Published as a conference paper at ICLRUnderstanding Trainable Sparse Coding via matrix factorization arXiv:1609.00285v4 [stat.ML] 29 May 2017 DocID: 1ued9 - View Document