Robustness of Sketches to Adaptive nputs

Channel:

Subscribers:

68,800

Published on October 12, 2023 9:57:14 AM ● Video Link: https://www.youtube.com/watch?v=yvWbvdmKQ0w

Duration: 50:13

82 views

Other Videos By Simons Institute for the Theory of Computing

2023-10-17	AND/OR Search Spaces for Anytime Probabilistic Reasoning
2023-10-17	Credal Models for Uncertainty and Logic Treatment
2023-10-16	Model Counting Meets Distinct Estimation
2023-10-16	The Intensional-Extensional Problem in Probabilistic Databases
2023-10-16	Compiling FO Sentences to Circuits: Upper Bounds and Lower Bounds on the Size of the Circuit
2023-10-13	Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
2023-10-13	Resizable Sketches
2023-10-13	A Simple Quantum Sketch With Applications to Graph Algorithms
2023-10-12	Insights from Engineering Sketches for Production and Using Sketches at Scale
2023-10-12	A Near-Linear Time Algorithm for the Chamfer Distance
2023-10-12	Robustness of Sketches to Adaptive nputs
2023-10-12	Tight Bounds for Volumetric Spanners in All Norms
2023-10-12	A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching
2023-10-11	Sketching Algorithms for Max-DICUT and other CSPs
2023-10-11	Error Correction for Streaming Messages
2023-10-11	Streaming Lower Bounds for the Needle Problems
2023-10-11	Streaming Euclidean k-median and k-means with o(log n) Space
2023-10-11	Capacity Analysis of Vector Symbolic Architectures
2023-10-11	Improved Frequency Estimation Algorithms with and without Predictions
2023-10-11	Testing Positive Semidefiniteness and Eigenvalue Approximation
2023-10-11	Sketching Techniques for Kernel Density Estimation or for Optimal Transport Computations

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Sketching and Algorithm Design

Edith Cohen