Fast matrix multiplication with big sparse data

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Big Data became a buzz word nowadays due to the evolution of huge volumes of data beyond peta bytes. This article focuses on matrix multiplication with big sparse data. The proposed FASTsparseMUL algorithm outperforms the state-of-the-art big matrix multiplication approaches in sparse data scenario.

Cite

CITATION STYLE

APA

Somasekhar, G., & Karthikeyan, K. (2017). Fast matrix multiplication with big sparse data. Cybernetics and Information Technologies, 17(1), 16–30. https://doi.org/10.1515/cait-2017-0002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free