Search for: All records

Award ID contains: 1763657

« Prev Next »

Total Resources

13

Resource Type
Conference Paper

8

Conference Proceeding

0

Dataset

0

Journal Article

5

Workshop Report

0

Availability
Full Text / Resource Available

12

Citation Only

1

Save Results
Excel (limit 2000)
CSV (limit 5000)
XML (limit 5000)

Have feedback or suggestions for a way to improve these results?
!

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Differentially Private Secure Multiplication: Hiding Information in the Rubble of Noise

https://doi.org/10.1109/ISIT54713.2023.10206949

Cadambe, Viveck R. ; Jeong, Haewon ; Calmon, Flavio P. ( June 2023 , IEEE International Symposium on Information Theory)

Free, publicly-accessible full text available June 25, 2024
Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off Limits

https://doi.org/10.1109/ISIT50566.2022.9834493

Devulapalli, Ateet ; Cadambe, Viveck R. ; Calmon, Flavio P. ; Jeong, Haewon ( June 2022 , 2022 IEEE International Symposium on Information Theory (ISIT))

Full Text Available
ϵ -Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication

https://doi.org/10.1109/JSAIT.2021.3099811

Jeong, Haewon ; Devulapalli, Ateet ; Cadambe, Viveck R. ; Calmon, Flavio P. ( September 2021 , IEEE Journal on Selected Areas in Information Theory)
null (Ed.)
Full Text Available
E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication

https://doi.org/10.1109/ISIT45174.2021.9517861

Cadambe, Viveck R. ; Calmon, Flavio P. ; Devulapalli, Ateet ; Jeong, Haewon ( July 2021 , 2021 IEEE International Symposium on Information Theory (ISIT))
null (Ed.)
Full Text Available
Numerically Stable Polynomially Coded Computing

https://doi.org/10.1109/TIT.2021.3050526

Fahim, Mohammad ; Cadambe, Viveck R. ( May 2021 , IEEE Transactions on Information Theory)
null (Ed.)
Full Text Available
3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication

https://doi.org/10.1007/978-3-030-57675-2_25

Haewon Jeong, Yaoqing Yang ( August 2020 , European Conference on Parallel Processing)
null ; null (Ed.)
Full Text Available
Addressing Unreliability in Emerging Devices and Non-von Neumann Architectures Using Coded Computing

https://doi.org/10.1109/JPROC.2020.2986362

Dutta, Sanghamitra ; Jeong, Haewon ; Yang, Yaoqing ; Cadambe, Viveck ; Low, Tze Meng ; Grover, Pulkit ( August 2020 , Proceedings of the IEEE)

Full Text Available
On the Optimal Recovery Threshold of Coded Matrix Multiplication

https://doi.org/10.1109/TIT.2019.2929328

Dutta, Sanghamitra ; Fahim, Mohammad ; Haddadpour, Farzin ; Jeong, Haewon ; Cadambe, Viveck ; Grover, Pulkit ( October 2019 , IEEE Transactions on Information Theory)

Full Text Available
“Short-Dot”: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products

https://doi.org/10.1109/TIT.2019.2927558

Dutta, Sanghamitra ; Cadambe, Viveck ; Grover, Pulkit ( October 2019 , IEEE Transactions on Information Theory)

Full Text Available
Lagrange Coded Computing with Sparsity Constraints

https://doi.org/10.1109/ALLERTON.2019.8919966

Fahim, Mohammad ; Cadambe, Viveck R. ( September 2019 , 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton))

In this paper, we propose a distributed coding scheme that allows for lower computation cost per computing node than the standard Lagrange Coded Computing scheme. The proposed coding scheme is useful for cases where the elements of the input data set are of large dimensions and the computing nodes have limited computation power. This coding scheme provides a trade-off between the computation cost per worker and the recovery threshold in a distributed coded computing framework. The proposed scheme is also extended to provide data privacy against at most t colluding worker nodes in the system.
more » « less
Full Text Available

« Prev Next »