Publisher
Springer International Publishing
Reference17 articles.
1. Ahle, T.D., et al.: Oblivious sketching of high-degree polynomial kernels. In: Proceedings of the 40th Symposium on Discrete Algorithms (SODA), pp. 141–160 (2020)
2. Ahle, T.D., Knudsen, J.B.: Almost optimal tensor sketch. arXiv preprint arXiv:1909.01821 (2019)
3. Ahle, T.D.: On the problem of $${{\rm p}_{1}^{-1}}$$ in locality-sensitive hashing. In: Proceedings of the 13th International Conference on Similarity Search and Applications (SISAP) (2020)
4. Ahle, T.D., Pagh, R., Razenshteyn, I., Silvestri, F.: On the complexity of inner product similarity join. In: Proceedings of the 35th Symposium on Principles of Database Systems (PODS), pp. 151–164 (2016)
5. Ahle, T.D., Silvestri, F.: Similarity search with tensor core units. arXiv preprint arXiv:2006.12608 (2020)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Mixed-precision block incomplete sparse approximate preconditioner on Tensor core;CCF Transactions on High Performance Computing;2023-09-13
2. SelB-k-NN: A Mini-Batch K-Nearest Neighbors Algorithm on AI Processors;2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2023-05
3. Leveraging GPU Tensor Cores for Double Precision Euclidean Distance Calculations;2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC);2022-12
4. Accelerating DBSCAN Algorithm with AI Chips for Large Datasets;50th International Conference on Parallel Processing;2021-08-09
5. Algorithm Design for Tensor Units;Euro-Par 2021: Parallel Processing;2021