Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Har-Peled, S., Indyk, P., & Motwani, R. Theory of Computing, 8(14):321–350, Theory of Computing, 2012.
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality [link]Paper  doi  bibtex   
@Article{peled12approximate,
  author    = {Har-Peled, Sariel and Indyk, Piotr and Motwani, Rajeev},
  title     = {Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality},
  journal   = {Theory of Computing},
  year      = {2012},
  volume    = {8},
  number    = {14},
  pages     = {321--350},
  doi       = {10.4086/toc.2012.v008a014},
  owner     = {Purva},
  publisher = {Theory of Computing},
  timestamp = {2016-09-18},
  url       = {http://www.theoryofcomputing.org/articles/v008a014},
}

Downloads: 0