Author:
Raoofy Amir,Karlstetter Roman,Schreiber Martin,Trinitis Carsten,Schulz Martin
Publisher
Springer Nature Switzerland
Reference41 articles.
1. Arya, S., et al.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM 45(6), 891–923 (1998)
2. Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature 324(6096), 446–449 (1986)
3. Cools, S., et al.: Improving strong scaling of the conjugate gradient method for solving large linear systems using global reduction pipelining. ArXiv abs/1905.06850 (2019)
4. Lecture Notes in Computer Science;RR Curtin,2015
5. Dau, H.A., Keogh, E.: Matrix profile V: a generic technique to incorporate domain knowledge into motif discovery. In: 23rd ACM SIGKDD, pp. 125–134 (2017)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20