Improving compressed matrix multiplication using control variate method
From MaRDI portal
Publication:6602328
DOI10.1016/J.IPL.2024.106517MaRDI QIDQ6602328FDOQ6602328
Authors: Bhisham Dev Verma, Punit Pankaj Dubey, Rameshwar Pratap, Manoj Thakur 
Publication date: 11 September 2024
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
Cites Work
- The space complexity of approximating the frequency moments
- New hash functions and their use in authentication and set equality
- Universal classes of hash functions
- Finding frequent items in data streams
- Gaussian elimination is not optimal
- Extra High Speed Matrix Multiplication on the Cray-2
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast sparse matrix multiplication
- Approximating Matrix Multiplication for Pattern Recognition Tasks
- A Perspective on the Use of Control Variables to Increase the Efficiency of Monte Carlo Simulations
- Frequent directions: simple and deterministic matrix sketching
- Compressed matrix multiplication
- Correlations between random projections and the bivariate normal
- Variance reduction in feature hashing using MLE and control variate method
- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
This page was built for publication: Improving compressed matrix multiplication using control variate method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602328)
