{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:13:03Z","timestamp":1730200383292,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bigdata.2018.8622429","type":"proceedings-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:07:18Z","timestamp":1548385638000},"page":"1113-1120","source":"Crossref","is-referenced-by-count":29,"title":["An Application of Storage-Optimal MatDot Codes for Coded Matrix Multiplication: Fast k-Nearest Neighbors Estimation"],"prefix":"10.1109","author":[{"given":"Utsav","family":"Sheth","sequence":"first","affiliation":[]},{"given":"Sanghamitra","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Malhar","family":"Chaudhari","sequence":"additional","affiliation":[]},{"given":"Haewon","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Yaoqing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jukka","family":"Kohonen","sequence":"additional","affiliation":[]},{"given":"Teemu","family":"Roos","sequence":"additional","affiliation":[]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050027"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2009.4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/2847220.2847223","article-title":"Using Straggler Replication to Reduce Latency in Large-scale Parallel Computing","volume":"43","author":"wang","year":"2015","journal-title":"SIGMET- RICS Performance Evaluation Review"},{"key":"ref16","first-page":"2092","article-title":"Short-Dot: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","author":"dutta","year":"2016","journal-title":"NIPS"},{"key":"ref17","first-page":"3","article-title":"Codes for Distributed Computing: A Tutorial","volume":"67","author":"cadambe","year":"2017","journal-title":"IEEE Inform Theory Newslett"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref19","first-page":"3368","article-title":"Gradient Coding: Avoiding Stragglers in Distributed Learning","author":"tandon","year":"2017","journal-title":"ICML"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSE.2015.7250218"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/YCICT.2009.5382329"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1265868"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.57"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNDC.2012.15"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2010.102"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2364046"},{"key":"ref1","first-page":"881","article-title":"Fast nearest neighbor search through sparse random projections and voting","author":"hyv\u00f6nen","year":"2016","journal-title":"IEEE Big Data"},{"key":"ref20","first-page":"5440","article-title":"Straggler Mitigation in Distributed Optimization through Data Encoding","author":"karakus","year":"2017","journal-title":"NIPS"},{"key":"ref22","article-title":"Coded FFT and Its Communication Overhead","author":"jeong","year":"2018","journal-title":"Comm Control and Computing (Allerton)"},{"key":"ref21","first-page":"709","article-title":"Coded Distributed Computing for Inverse Problems","author":"yang","year":"2017","journal-title":"NIPS"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref26","first-page":"215","article-title":"An analysis of single-layer networks in unsupervised feature learning","author":"coates","year":"2011","journal-title":"AISTATS"},{"year":"0","key":"ref25","article-title":"Amazon AWS"}],"event":{"name":"2018 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2018,12,10]]},"location":"Seattle, WA, USA","end":{"date-parts":[[2018,12,13]]}},"container-title":["2018 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8610059\/8621858\/08622429.pdf?arnumber=8622429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:56:46Z","timestamp":1643241406000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8622429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2018.8622429","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}