Lower Bounds for NNS and Metric Expansion. Rina Panigrahy Kunal Talwar Udi Wieder Microsoft Research SVC. TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A. Nearest Neighbor Search. Given points in a metric space
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Microsoft Research SVC
TexPoint fonts used in EMF.
Read the TexPoint manual before you delete this box.: AA
Given points in a metric space
Preprocess into a small data structure
Given a query point
Quickly retrieve the closest to
Preprocess into data structure with
Query algorithm gets charged t
if it probes words of
Study tradeoff between and
In this talk
Show a unified approach for proving cell probe lower bounds for near neighbor and other similar problems.
Show that all lower bounds stem from the same combinatorial property of the metric space
Expansion : |number of points near A|/|A|
(show some new lower bounds)
Need to relax the definition of vertex expansion
Unified approach to NNS cell probe lower bounds
Need to relax the definition of vertex expansion and independence
is weakly independent if for random it holds that