{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:21:16Z","timestamp":1756383676915,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_6","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"76-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Similarity Search with Tensor Core Units"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9747-0479","authenticated-orcid":false,"given":"Thomas","family":"D. Ahle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9077-9921","authenticated-orcid":false,"given":"Francesco","family":"Silvestri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ahle, T.D., et al.: Oblivious sketching of high-degree polynomial kernels. In: Proceedings of the 40th Symposium on Discrete Algorithms (SODA), pp. 141\u2013160 (2020)","DOI":"10.1137\/1.9781611975994.9"},{"key":"6_CR2","unstructured":"Ahle, T.D., Knudsen, J.B.: Almost optimal tensor sketch. arXiv preprint arXiv:1909.01821 (2019)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-030-60936-8_7"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013164 (2016)","DOI":"10.1145\/2902251.2902285"},{"key":"6_CR5","unstructured":"Ahle, T.D., Silvestri, F.: Similarity search with tensor core units. arXiv preprint arXiv:2006.12608 (2020)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Ailon, N., Chazelle, B.: Approximate nearest neighbors and the fast johnson-lindenstrauss transform. In: Proceedings of the 38th Symposium on Theory of computing (STOC), pp. 557\u2013563 (2006)","DOI":"10.1145\/1132516.1132597"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00454-008-9110-x","volume":"42","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Liberty, E.: Fast dimension reduction using rademacher series on dual BCH codes. Discr. Comput. Geom. 42(4), 615 (2009)","journal-title":"Discr. Comput. Geom."},{"key":"6_CR8","unstructured":"Alman, J.: Limits on the universal method for matrix multiplication. In: Proceedings of the 34th Computational Complexity Conference (CCC), vol. 137, pp. 12:1\u201312:24 (2019)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Chowdhury, R., Silvestri, F., Vella, F.: Brief announcement: a computational model for tensor core units. In: Proceedings of the 32nd Symposium on Parallelism in Algorithms and Architectures (SPAA) (2020)","DOI":"10.1145\/3350755.3400252"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dakkak, A., Li, C., Xiong, J., Gelado, I., Hwu, W.M.: Accelerating reduction and scan using tensor core units. In: Proceedings of the International Conference on Supercomputing (ICS) (2019)","DOI":"10.1145\/3330345.3331057"},{"key":"6_CR11","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of VLDB\u201999, pp. 518\u2013529 (1999)"},{"issue":"9","key":"6_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/3154484","volume":"61","author":"NP Jouppi","year":"2018","unstructured":"Jouppi, N.P., Young, C., Patil, N., Patterson, D.A.: A domain-specific architecture for deep neural networks. Commun. ACM 61(9), 50\u201359 (2018)","journal-title":"Commun. ACM"},{"key":"6_CR13","unstructured":"Jouppi, N.P., et al.: In-datacenter performance analysis of a tensor processing unit. In: Proceedings of the 44th International Symposium on Computer Architecture (ISCA), pp. 1\u201312 (2017)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559902","volume":"61","author":"DM Kane","year":"2014","unstructured":"Kane, D.M., Nelson, J.: Sparser Johnson-Lindenstrauss transforms. J. ACM (JACM) 61(1), 1\u201323 (2014)","journal-title":"J. ACM (JACM)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lu, T., Chen, Y.F., Hechtman, B., Wang, T., Anderson, J.: Large-scale discrete fourier transform on TPUs (2020)","DOI":"10.1109\/ACCESS.2021.3092312"},{"key":"6_CR16","unstructured":"Nvidia Tesla V100 GPU architecture. http:\/\/images.nvidia.com\/content\/volta-architecture\/pdf\/volta-architecture-whitepaper.pdf"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/s00453-017-0285-5","volume":"78","author":"R Pagh","year":"2017","unstructured":"Pagh, R., Pham, N., Silvestri, F., St\u00f6ckel, M.: I\/O-efficient similarity join. Algorithmica 78(4), 1263\u20131283 (2017)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:41:46Z","timestamp":1710250906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}