{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:10Z","timestamp":1750221010259,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MSS18C001"],"award-info":[{"award-number":["MSS18C001"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330826","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"314-323","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Coresets for Minimum Enclosing Balls over Sliding Windows"],"prefix":"10.1145","author":[{"given":"Yanhao","family":"Wang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore, Singapore"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Pankaj K. Agarwal and R. Sharathkumar. 2010. Streaming Algorithms for Extent Problems in High Dimensions. In SODA . 1481--1489.   Pankaj K. Agarwal and R. Sharathkumar. 2010. Streaming Algorithms for Extent Problems in High Dimensions. In SODA . 1481--1489.","DOI":"10.1137\/1.9781611973075.120"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219973"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.04.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020501"},{"volume-title":"Convex Optimization","author":"Boyd Stephen","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Vladimir Braverman Harry Lang Keith Levin and Morteza Monemizadeh. 2016. Clustering Problems on Sliding Windows. In SODA. 1374--1390.   Vladimir Braverman Harry Lang Keith Levin and Morteza Monemizadeh. 2016. Clustering Problems on Sliding Windows. In SODA. 1374--1390.","DOI":"10.1137\/1.9781611974331.ch95"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.63"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159719"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1646483.1646578"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.05.007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2008.2006620"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824783"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052699"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783312"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Kaspar Fischer Bernd G\"a rtner and Martin Kutz. 2003. Fast Smallest-Enclosing-Ball Computation in High Dimensions. In ESA. 630--641.  Kaspar Fischer Bernd G\"a rtner and Martin Kutz. 2003. Fast Smallest-Enclosing-Ball Computation in High Dimensions. In ESA. 630--641.","DOI":"10.1007\/978-3-540-39658-1_57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Bernd G\"artner. 1999. Fast and Robust Smallest Enclosing Balls. In ESA. 325--338.   Bernd G\"artner. 1999. Fast and Robust Smallest Enclosing Balls. In ESA. 325--338.","DOI":"10.1007\/3-540-48481-7_29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_3_2_1_21_1","unstructured":"Jonathan H. Huggins Trevor Campbell and Tamara Broderick. 2016. Coresets for Scalable Bayesian Logistic Regression. In NIPS . 4080--4088.   Jonathan H. Huggins Trevor Campbell and Tamara Broderick. 2016. Coresets for Scalable Bayesian Logistic Regression. In NIPS . 4080--4088."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/996546.996548"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12176"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25087-8_1"},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"Near-Optimal Coresets of Kernel Density Estimates","volume":"66","author":"Phillips Jeff M.","year":"2018","journal-title":"SoCG."},{"volume-title":"Hal Daum\u00e9 III, and Suresh Venkatasubramanian","year":"2009","author":"Rai Piyush","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1058114"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"volume-title":"Efficient Representative Subset Selection over Sliding Windows","year":"2018","author":"Wang Yanhao","key":"e_1_3_2_1_30_1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Yanhao Wang Yuchen Li and Kian-Lee Tan. 2019. Coresets for Minimum Enclosing Balls over Sliding Windows. (2019).  Yanhao Wang Yuchen Li and Kian-Lee Tan. 2019. Coresets for Minimum Enclosing Balls over Sliding Windows. (2019).","DOI":"10.1145\/3292500.3330826"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:02Z","timestamp":1750206362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":31,"alternative-id":["10.1145\/3292500.3330826","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330826","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}