{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T06:39:24Z","timestamp":1723531164602},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737482","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"source":"Crossref","is-referenced-by-count":7,"title":["Efficiently Inferring Top-k Elephant Flows based on Discrete Tensor Completion"],"prefix":"10.1109","author":[{"given":"Kun","family":"Xie","sequence":"first","affiliation":[]},{"given":"Jiazheng","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Gaogang","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Jigang","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Dafang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524364"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.21236\/ADA439086"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2291416"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637210"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2169424"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398818"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2639108.2639129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524463"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057218"},{"key":"ref28","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2611482"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028813"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_33"},{"key":"ref29","article-title":"Network coordinates in the wild","author":"ledlie","year":"0","journal-title":"Proceedings of USENIX NSDI 2007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref8","first-page":"398","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"International Conference on Database Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347554"},{"key":"ref9","first-page":"909","article-title":"Heavykeeper: An accurate algorithm for finding top-k elephant flows","author":"gong","year":"2018","journal-title":"2018 USENIX Annual Technical Conference (Usenix ATC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"ref20","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225078"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901451"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1335"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737482.pdf?arnumber=8737482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:02Z","timestamp":1657854902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737482\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737482","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}