E.3. Analysis of Algorithms and Problem Complexity
1. Non-zero probability of nearest neighbor searching

A. Mesrikhani; M. Davoodi

Volume 5, Issue 1 , Winter 2017, , Pages 101-109

Abstract
  Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data ...  Read More