sentences:  For some applications (e.g.entropy estimation), we may have "N" data-points and wish to know which is the nearest neighbor "for every one of those N points".This could, of course, be achieved by running a nearest-neighbor search once for every point, but an improved strategy would be an algorithm that exploits the information redundancy between these "N" queries to produce a more efficient search.