An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors.
Sebastian Bruch|Franco Maria Nardini|Amir Ingber|Edo Liberty
| Anthology ID: | DBLP:journals/tois/BruchNIL24 |
|---|---|
| Year: | 2024 |
| Venue: | ACM Transactions on Information Systems (TOIS) |
| Pages: | 42:1-42:43 |
| URL: | https://doi.org/10.1145/3609797 |
| DOI: | https://doi.org/10.1145/3609797 |
| DBLP: | journals/tois/BruchNIL24 |
| BibTeX: |
@article{bruch-2024-approximate,
author = {Sebastian Bruch and
Franco Maria Nardini and
Amir Ingber and
Edo Liberty},
title = {{An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors}},
journal = {ACM Transactions on Information Systems (TOIS)},
volume = {42},
number = {2},
pages = {42:1--42:43},
year = {2024},
url = {https://doi.org/10.1145/3609797},
doi = {https://doi.org/10.1145/3609797}
}