E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication. Cadambe, V. R., Calmon, F. P., Devulapalli, A., & Jeong, H. In IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021, pages 1582–1587, 2021. IEEE.
E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/isit/CadambeCDJ21,
  author       = {Viveck R. Cadambe and
                  Fl{\'{a}}vio P. Calmon and
                  Ateet Devulapalli and
                  Haewon Jeong},
  title        = {E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient
                  as Exact Multiplication},
  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,
                  Melbourne, Australia, July 12-20, 2021},
  pages        = {1582--1587},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/ISIT45174.2021.9517861},
  doi          = {10.1109/ISIT45174.2021.9517861},
  timestamp    = {Sun, 06 Oct 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isit/CadambeCDJ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0