FRS: Fast Range Search by Pruning Unnecessary Distance Computations Based on K-D Tree

Yewang Chen, Jai Puneet Singh, Lida Zhou, Nizar Bouguila. FRS: Fast Range Search by Pruning Unnecessary Distance Computations Based on K-D Tree. In Raju Gottumukkala, Xia Ning, Guozhu Dong, Vijay Raghavan, Srinivas Aluru, George Karypis, Lucio Miele, Xindong Wu, editors, 2017 IEEE International Conference on Data Mining Workshops, ICDM Workshops 2017, New Orleans, LA, USA, November 18-21, 2017. pages 1160-1165, IEEE Computer Society, 2017. [doi]

@inproceedings{ChenSZB17,
  title = {FRS: Fast Range Search by Pruning Unnecessary Distance Computations Based on K-D Tree},
  author = {Yewang Chen and Jai Puneet Singh and Lida Zhou and Nizar Bouguila},
  year = {2017},
  doi = {10.1109/ICDMW.2017.166},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2017.166},
  researchr = {https://researchr.org/publication/ChenSZB17},
  cites = {0},
  citedby = {0},
  pages = {1160-1165},
  booktitle = {2017 IEEE International Conference on Data Mining Workshops, ICDM Workshops 2017, New Orleans, LA, USA, November 18-21, 2017},
  editor = {Raju Gottumukkala and Xia Ning and Guozhu Dong and Vijay Raghavan and Srinivas Aluru and George Karypis and Lucio Miele and Xindong Wu},
  publisher = {IEEE Computer Society},
  isbn = {978-1-5386-3800-2},
}