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
Cloud Computing Concepts, Part 1University of Illinois at Urbana-Champaign via Coursera Cloud Computing Concepts: Part 2
University of Illinois at Urbana-Champaign via Coursera Reliable Distributed Algorithms - Part 1
KTH Royal Institute of Technology via edX Introduction to Apache Spark and AWS
University of London International Programmes via Coursera Réalisez des calculs distribués sur des données massives
CentraleSupélec via OpenClassrooms