Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree

Kaushik Sinha. Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree. In Asim Roy, Plamen Angelov, Adel M. Alimi, Ganesh Kumar Venayagamoorthy, Theodore B. Trafalis, editors, INNS Conference on Big Data 2015, San Francisco, CA, USA, 8-10 August 2015. Volume 53 of Procedia Computer Science, pages 64-73, Elsevier, 2015. [doi]

@inproceedings{Sinha15-0,
  title = {Fast £1-norm Nearest Neighbor Search Using A Simple Variant of Randomized Partition Tree},
  author = {Kaushik Sinha},
  year = {2015},
  doi = {10.1016/j.procs.2015.07.280},
  url = {http://dx.doi.org/10.1016/j.procs.2015.07.280},
  researchr = {https://researchr.org/publication/Sinha15-0},
  cites = {0},
  citedby = {0},
  pages = {64-73},
  booktitle = {INNS Conference on Big Data 2015, San Francisco, CA, USA, 8-10 August 2015},
  editor = {Asim Roy and Plamen Angelov and Adel M. Alimi and Ganesh Kumar Venayagamoorthy and Theodore B. Trafalis},
  volume = {53},
  series = {Procedia Computer Science},
  publisher = {Elsevier},
}