In this paper, we report progress on answering the open problem presented by Pagh [11], who considered the nearest neighbor search without false negatives for the Hamming distance. We show new data structures for solving the c-approximate nearest neighbors problem without false negatives for Euclidean high dimensional space R. These data structures work for any c = ω( √ log logn), where n is th...
