Multi-Resolution Hashing for Fast Pairwise Summations
Offered By: IEEE via YouTube
Course Description
Overview
Explore an innovative approach to accelerating pairwise summations through multi-resolution hashing in this 20-minute IEEE conference talk. Delve into applications, motivations, and key results as speakers Moses Charikar and Paris Siminelakis compare their work with previous research. Gain insights into crucial concepts such as bias on link cuts, disjoint support, and the scale-free property. Discover the main contributions, including partitions of unity and multi-resolution HB, and understand how these ideas come together to form a powerful solution for fast pairwise summations.
Syllabus
Intro
Applications
Motivation
Results
Comparison with Previous Work
Key Ideas
Bias on Link
Cuts
Disjoint Support
Defining the scalefree property
Our main contribution
Partitions of unity
Partition of unity
Multiresolution HB
Summary
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube