Name
Abstract | ||
|---|---|---|
We present an approximate algorithm for matrix multiplication based on matrix sketching techniques. First one of the matrix is chosen and sparsified using the online matrix sketching algorithm, and then the matrix product is calculated using the sparsified matrix. We prove when the sample number grows large compared to the sample dimensions the proposed algorithm achieves similar accuracy bound with a smaller computational cost compared to the state-of-the-art algorithms. |
Year | Venue | DocType |
|---|---|---|
2014 | arXiv: Numerical Analysis | Journal |
Volume | Citations | PageRank |
abs/1406.2648 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huan Wang | 1 | 57 | 6.82 |
| Christos Boutsidis | 2 | 610 | 33.37 |
| Edo Liberty | 3 | 5 | 1.12 |
| Daniel Hsu | 4 | 2158 | 113.05 |