YoVDO

Shaving Logs by Weighing Coins - Extroverted Sublinear Algorithms

Offered By: Simons Institute via YouTube

Tags

Sublinear Algorithms Courses Randomized Algorithms Courses Combinatorial Optimization Courses Probability Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a fascinating lecture by Deeparnab Chakrabarty from Dartmouth College on the intriguing concept of "shaving logs by weighing coins" as part of the Extroverted Sublinear Algorithms series. Delve into advanced algorithmic techniques and their applications in this 39-minute presentation hosted by the Simons Institute. Gain insights into innovative approaches for optimizing computational processes and solving complex problems efficiently.

Syllabus

Shaving logs by weighing coins


Taught by

Simons Institute

Related Courses

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
Association for Computing Machinery (ACM) via YouTube Sublinear Algorithms for Gap Edit Distance
IEEE via YouTube High Dimensional Robust Sparse Regression
Simons Institute via YouTube Learning-Augmented Sketches for Frequency Estimation
Simons Institute via YouTube Adaptive Sparse Recovery with Limited Adaptivity
Simons Institute via YouTube