{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:23:47Z","timestamp":1782933827085,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T00:00:00Z","timestamp":1597622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ELIXIR CZ (MEYS)","award":["LM2018131"],"award-info":[{"award-number":["LM2018131"]}]},{"name":"Czech Science Foundation","award":["19-22071Y"],"award-info":[{"award-number":["19-22071Y"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,17]]},"DOI":"10.1145\/3404397.3404426","type":"proceedings-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T03:54:26Z","timestamp":1596945266000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Detailed Analysis and Optimization of CUDA K-means Algorithm"],"prefix":"10.1145","author":[{"given":"Martin","family":"Kruli\u0161","sequence":"first","affiliation":[{"name":"Charles University, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miroslav","family":"Kratochv\u00edl","sequence":"additional","affiliation":[{"name":"Charles University, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/cyto.a.21007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5566\/ias.1611"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2017.12.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3390\/s18051419"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.06.090"},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on Machine Learning. 579\u2013587","author":"Ding Yufei","year":"2015"},{"key":"e_1_3_2_1_8_1","unstructured":"Reza Farivar Daniel Rebolledo Ellick Chan and Roy\u00a0H Campbell. 2008. A Parallel Implementation of K-Means Clustering on GPUs.. In Pdpta Vol.\u00a013. 212\u2013312.  Reza Farivar Daniel Rebolledo Ellick Chan and Roy\u00a0H Campbell. 2008. A Parallel Implementation of K-Means Clustering on GPUs.. In Pdpta Vol.\u00a013. 212\u2013312."},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithms for clustering data","author":"Jain K"},{"key":"e_1_3_2_1_10_1","volume-title":"Finding groups in data: an introduction to cluster analysis. Vol.\u00a0344","author":"Kaufman Leonard"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.537105"},{"key":"e_1_3_2_1_12_1","volume-title":"SOM-Hunter: Video Browsing with Relevance-to-SOM Feedback Loop. In International Conference on Multimedia Modeling. Springer, 790\u2013795","author":"Kratochv\u00edl Miroslav","year":"2020"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-015-2726-y"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-3677-7"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25087-8_25"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2012.05.004"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13222-018-0293-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.034"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3303084.3309488"},{"key":"e_1_3_2_1_20_1","volume-title":"Medical image segmentation using k-means clustering and improved watershed algorithm. In 2006 IEEE southwest symposium on image analysis and interpretation","author":"Ng HP"},{"key":"e_1_3_2_1_21_1","volume-title":"A simple and fast algorithm for K-medoids clustering. Expert systems with applications 36, 2","author":"Park Hae-Sang","year":"2009"},{"key":"e_1_3_2_1_22_1","volume-title":"A method for initialising the K-means clustering algorithm using kd-trees. Pattern recognition letters 28, 8","author":"Redmond J","year":"2007"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85836-2_16"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/cyto.a.22625"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13640-018-0309-3"}],"event":{"name":"ICPP '20: 49th International Conference on Parallel Processing","location":"Edmonton AB Canada","acronym":"ICPP '20"},"container-title":["49th International Conference on Parallel Processing - ICPP"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404426","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3404397.3404426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:42Z","timestamp":1750195902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404397.3404426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,17]]},"references-count":24,"alternative-id":["10.1145\/3404397.3404426","10.1145\/3404397"],"URL":"https:\/\/doi.org\/10.1145\/3404397.3404426","relation":{},"subject":[],"published":{"date-parts":[[2020,8,17]]},"assertion":[{"value":"2020-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}