BibTeX record conf/icmla/Sinha14

download as .bib file

@inproceedings{DBLP:conf/icmla/Sinha14,
  author       = {Kaushik Sinha},
  title        = {{LSH} vs Randomized Partition Trees: Which One to Use for Nearest
                  Neighbor Search?},
  booktitle    = {13th International Conference on Machine Learning and Applications,
                  {ICMLA} 2014, Detroit, MI, USA, December 3-6, 2014},
  pages        = {41--46},
  publisher    = {{IEEE}},
  year         = {2014},
  url          = {https://doi.org/10.1109/ICMLA.2014.13},
  doi          = {10.1109/ICMLA.2014.13},
  timestamp    = {Wed, 16 Oct 2019 14:14:53 +0200},
  biburl       = {https://dblp.org/rec/conf/icmla/Sinha14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.