(2010) introduced a way of using locality sensitive hashing (LSH) to make this time O(1), while retaining the same accuracy level.
instead of computing the max over the entire set D t , like in (1), they compute it over a smaller set S of potential nearest neighbors.