Sparsity and Privacy in Distributed Matrix Multiplication
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the intersection of sparsity and privacy in distributed matrix multiplication through this insightful 27-minute talk by Rawad Bitar from the Technical University of Munich. Delve into the concepts of application-driven coding theory as part of the Simons Institute's series on advanced mathematical topics. Gain valuable insights into how sparsity affects privacy concerns in distributed computing environments and learn about potential solutions for maintaining data confidentiality while optimizing computational efficiency.
Syllabus
Sparsity and Privacy in Distributed Matrix Multiplication
Taught by
Simons Institute
Related Courses
First Order Optical System DesignUniversity of Colorado Boulder via Coursera Arithmetic Circuit Complexity
Indian Institute of Technology Kanpur via Swayam Introduction to Quantum Computing for Everyone
The University of Chicago via edX Dynamic Programming, Greedy Algorithms
University of Colorado Boulder via Coursera Linear Algebra
YouTube