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. 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
{"_id":"6M99DYPfAYoMSj3SL","bibbaseid":"cadambe-calmon-devulapalli-jeong-eapproximatecodedmatrixmultiplicationisnearlytwiceasefficientasexactmultiplication-2021","author_short":["Cadambe, V. R.","Calmon, F. P.","Devulapalli, A.","Jeong, H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Viveck","R."],"propositions":[],"lastnames":["Cadambe"],"suffixes":[]},{"firstnames":["Flávio","P."],"propositions":[],"lastnames":["Calmon"],"suffixes":[]},{"firstnames":["Ateet"],"propositions":[],"lastnames":["Devulapalli"],"suffixes":[]},{"firstnames":["Haewon"],"propositions":[],"lastnames":["Jeong"],"suffixes":[]}],"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","bibtex":"@inproceedings{DBLP:conf/isit/CadambeCDJ21,\n author = {Viveck R. Cadambe and\n Fl{\\'{a}}vio P. Calmon and\n Ateet Devulapalli and\n Haewon Jeong},\n title = {E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient\n as Exact Multiplication},\n booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2021,\n Melbourne, Australia, July 12-20, 2021},\n pages = {1582--1587},\n publisher = {{IEEE}},\n year = {2021},\n url = {https://doi.org/10.1109/ISIT45174.2021.9517861},\n doi = {10.1109/ISIT45174.2021.9517861},\n timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/isit/CadambeCDJ21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Cadambe, V. R.","Calmon, F. P.","Devulapalli, A.","Jeong, H."],"key":"DBLP:conf/isit/CadambeCDJ21","id":"DBLP:conf/isit/CadambeCDJ21","bibbaseid":"cadambe-calmon-devulapalli-jeong-eapproximatecodedmatrixmultiplicationisnearlytwiceasefficientasexactmultiplication-2021","role":"author","urls":{"Paper":"https://doi.org/10.1109/ISIT45174.2021.9517861"},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/53/5503.bib","dataSources":["bCgZzjwXJrrWbsakA"],"keywords":[],"search_terms":["approximate","coded","matrix","multiplication","nearly","twice","efficient","exact","multiplication","cadambe","calmon","devulapalli","jeong"],"title":"E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication","year":2021}