Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics

Ninh Pham. Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics. In Feida Zhu 0002, Beng Chin Ooi, Chunyan Miao, editors, KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, August 14-18, 2021. pages 1339-1347, ACM, 2021. [doi]

@inproceedings{Pham21-2,
  title = {Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics},
  author = {Ninh Pham},
  year = {2021},
  doi = {10.1145/3447548.3467345},
  url = {https://doi.org/10.1145/3447548.3467345},
  researchr = {https://researchr.org/publication/Pham21-2},
  cites = {0},
  citedby = {0},
  pages = {1339-1347},
  booktitle = {KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, August 14-18, 2021},
  editor = {Feida Zhu 0002 and Beng Chin Ooi and Chunyan Miao},
  publisher = {ACM},
  isbn = {978-1-4503-8332-5},
}