Corpus ID: 25332147

Improved approximate near neighbor search without false negatives for $l_2$

@article{Wygocki2017ImprovedAN,
  title={Improved approximate near neighbor search without false negatives for \$l_2\$},
  author={Piotr Wygocki},
  journal={ArXiv},
  year={2017},
  volume={abs/1709.10338}
}

Piotr Wygocki

Published 2017

Mathematics, Computer Science

ArXiv

We present a new algorithm for the $c$--approximate nearest neighbor search without false negatives for $l_2^d$. We enhance the dimension reduction method presented in \cite{wygos_red} and combine it with the standard results of Indyk and Motwani~\cite{motwani}. We present an efficient algorithm with Las Vegas guaranties for any $c>1$. This improves over the previous results, which require $c=\omega(\log\log{n})$ \cite{wygos_red}, where $n$ is the number of the input points. Moreover, we… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed