Sketching Techniques for Data Structures and Optimization - Part 1
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the fundamentals of sketching algorithms in this hour-long lecture by Michael Kapralov from EPFL. Delve into the first part of a comprehensive overview on data structures and optimization techniques for fast algorithms. Learn about the core concepts and applications of sketching in computer science, with a focus on how these methods can be used to efficiently process and analyze large datasets. Gain insights into the theoretical foundations and practical implementations of sketching algorithms, and understand their role in modern algorithmic design. This talk, part of the Data Structures and Optimization for Fast Algorithms Boot Camp at the Simons Institute, provides a solid foundation for researchers and practitioners interested in advanced algorithmic techniques.
Syllabus
Sketching Part 1
Taught by
Simons Institute
Related Courses
Divide and Conquer, Sorting and Searching, and Randomized AlgorithmsStanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera Finding Hidden Messages in DNA (Bioinformatics I)
University of California, San Diego via Coursera Algorithms for Big Data
Indian Institute of Technology Madras via Swayam