Neyman Seminar: Algorithmic design via efficient data representations

Neyman Seminar: Algorithmic design via efficient data representations

Neyman Seminar
Feb 25, 2015, 01:00 PM - 02:00 PM | 1011 Evans Hall | Happening As Scheduled
Alexandr Andoni, Simons Institute for the Theory of Computing, UC Berkeley (Speaker)
The growing size and dimension of data demands new algorithmic design frameworks. In this talk, I describe how such frameworks emerge from the methods of efficient data representations, such as dimension reduction but also more novel ones. The first illustration is the Nearest Neighbor Search (NNS) problem, which is of key importance for statistical classification and many other areas. Its...