Reductions Among High Dimensional Proximity Problems

  • Piotr Indyky Kasturi VaradarajanzApril
  • Published 2000


We present improved running times for a wide range of approximate high dimensional proximity problems. We obtain subquadratic running time for each of these problems. These improved running times are obtained by reduction to Nearest Neighbour queries. The problems we consider in this paper are 


  • Presentations referencing similar topics