Monday, January 10

Session 5B

9:00 AM-10:40 PM
Room: Oregon/Nevada

9:00 Approximate Congruence in Nearly Linear Time
Piotr Indyk and Suresh Venkatasubramanian, Stanford University
9:25 Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search
Peter N. Yianilos, NEC Research Institute and Princeton University
9:50 Dimensionality Reduction Techniques for Proximity Problems
Piotr Indyk, Stanford University
10:15 Expected-Case Complexity of Approximate Nearest Neighbor Searching
Sunil Arya and Ho-Yam Addy Fu, The Hong Kong University of Science and Technology, China

© 1999, Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 11/7/99; Last Updated 11/7/99