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

YouTube

O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking lecture on improving approximation for nearest neighbor search under the Earth Mover's Distance (EMD). Delve into the first advancement in this field in over a decade, presented by Rajesh Jayaram from Google Research NYC. Learn about the EMD metric, its significance in computer science, and its application in comparing sets of points. Discover the innovative approach to achieving an Õ(log s) approximation with sublinear query time, improving upon previous O(log^2 s) results. Gain insights into data-dependent locality sensitive hash functions for EMD, tree embedding techniques, and the key concepts behind this improved algorithm. Understand the implications of this research for sublinear algorithms and its potential impact on various applications of EMD in computer science.

Syllabus

O(log s)-Approximate Nearest Neighbor Search for the Earth Mover’s Distance

Taught by

Simons Institute

Reviews

Start your review of O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance

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.