Conference
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
| Τίτλος: | ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms |
|---|---|
| Συγγραφείς: | Manohar, Magdalen Dobson, Shen, Zheqi, Blelloch, Guy, Dhulipala, Laxman, Gu, Yan, Simhadri, Harsha Vardhan, Sun, Yihan |
| Πηγή: | Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming. :270-285 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3627535.3638475 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
καταχωρήστε σχόλιο πρώτοι!