Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search-Reference-Cited by-同舟云学术

Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search

Published:2019 Issue: Volume: Page:3-17
ISSN:0302-9743
Container-title:Similarity Search and Applications
language:
Short-container-title:

Author:

Christiani Tobias

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-32047-8_1

Reference34 articles.

1. Andoni, A., Indyk, P.: Efficient algorithms for substring near neighbor problem. In: Proceedings of the SODA 2006, pp. 1203–1212 (2006)

2. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of the FOCS 2006, pp. 459–468 (2006)

3. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008)

4. Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal LSH for angular distance. In: Proceedings of the NIPS 2015, pp. 1225–1233 (2015)

5. Andoni, A., Laarhoven, T., Razenshteyn, I.P., Waingarten, E.: Optimal hashing-based time-space trade-offs for approximate near neighbors. In: Proceedings of the SODA 2017, pp. 47–66 (2017)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secure Cloud-Aided Approximate Nearest Neighbor Search on High-Dimensional Data;IEEE Access;2023

2. Solving k-Closest Pairs in High-Dimensional Data;Similarity Search and Applications;2023

3. Fast and Scalable Mining of Time Series Motifs with Probabilistic Guarantees;Proceedings of the VLDB Endowment;2022-09

4. Privacy-Preserving near Neighbor Search via Sparse Coding with Ambiguation;ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2021-06-06

5. Towards a Learned Index Structure for Approximate Nearest Neighbor Search Query Processing;Similarity Search and Applications;2021