Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Multi-Resolution Hashing for Fast Pairwise Summations

IEEE via YouTube

Overview

Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
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

Reviews

Start your review of Multi-Resolution Hashing for Fast Pairwise Summations

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.