{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:25:10Z","timestamp":1725495910498},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/cns.2013.6682718","type":"proceedings-article","created":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T19:48:17Z","timestamp":1387309697000},"page":"287-295","source":"Crossref","is-referenced-by-count":2,"title":["Identifying high-cardinality hosts from network-wide traffic measurements"],"prefix":"10.1109","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenji","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195691"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061325"},{"key":"15","article-title":"Loglog Counting of Large Cardinalities","author":"durand","year":"0","journal-title":"European Symposium on Algorithms Budapest Hungary September 2003"},{"key":"16","article-title":"HyperLogLog: The Analysis of a Near-optimal Cardinality Estimation Algorithm","author":"flajolet","year":"0","journal-title":"The 2007 Conference on Analysis of Algorithms Juan des Pins France June 2007"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"14","article-title":"Counting Distinct Elements in a Data Stream","author":"bar-yossef","year":"0","journal-title":"6th International Workshop on Randomization and Approximation Techniques in Computer Science Cambridge Massachusetts September 2002"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213562"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896150"},{"journal-title":"Error-Correcting Linear Codes Classification by Isometry and Applications (Algorithms and Computation in Mathematics)","year":"2006","author":"betten","key":"21"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177099"},{"key":"22","first-page":"636","article-title":"Network applications of bloom filters: A survey","author":"broder","year":"2002","journal-title":"Internet Mathematics"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1561\/0400000007"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"25","first-page":"1190","article-title":"Lower bounds for sparse recovery","author":"do ba","year":"2010","journal-title":"SODA"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"journal-title":"Rice Dsp Group Compressed Sensing Resource","year":"0","key":"28"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195385014.001.0001"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039860"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989541"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2009.5426280"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061990"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061991"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2006.320197"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330117"},{"key":"8","first-page":"149","article-title":"New streaming algorithms for fast detection of superspreaders","author":"venkataraman","year":"2005","journal-title":"NDSS'05"}],"event":{"name":"2013 IEEE Conference on Communications and Network Security (CNS)","start":{"date-parts":[[2013,10,14]]},"location":"National Harbor, MD, USA","end":{"date-parts":[[2013,10,16]]}},"container-title":["2013 IEEE Conference on Communications and Network Security (CNS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6675898\/6682673\/06682718.pdf?arnumber=6682718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:07:03Z","timestamp":1490227623000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6682718\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/cns.2013.6682718","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}