{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:27:51Z","timestamp":1765484871987,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2004.1354567","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T09:34:02Z","timestamp":1103794442000},"page":"1534-1545","source":"Crossref","is-referenced-by-count":41,"title":["What's new: Finding significant differences in network data streams"],"prefix":"10.1109","volume":"3","author":[{"given":"G.","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781045"},{"key":"ref31","article-title":"Detecting packet patterns at high speeds","author":"varghese","year":"2002","journal-title":"SIGCOMM"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/90.330413"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773182"},{"key":"ref11","article-title":"An improved data stream summary: The count-min sketch and its applications","author":"cormode","year":"2004","journal-title":"Journal of Algorithms"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","article-title":"Estimating rarity and similarity over data stream windows","volume":"2461","author":"datar","year":"2002","journal-title":"Lecture Notes in Computer Science"},{"key":"ref13","article-title":"Combinatorial Group Testing and Its Applications","volume":"3","author":"du","year":"1993","journal-title":"Series on Applied Mathematics"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863972"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633056"},{"key":"ref16","article-title":"Data streaming in computer networks","author":"estan","year":"2003","journal-title":"In Proceedings of Workshop on Management and Processing of Data Streams"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948225"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/SFFCS.1999.814623","article-title":"An approximate L1-difference algorithm for massive data streams","author":"feigenbaum","year":"1999","journal-title":"Proc 40th Annu Symp Foundations of Computer Science"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564794"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303978"},{"key":"ref6","first-page":"693","article-title":"Finding frequent items in data streams","author":"charikar","year":"2002","journal-title":"In Procedings of the International Colloquium on Automata Languages and Programming ICALP)"},{"key":"ref29","article-title":"Data streams: Algorithms and applications","author":"muthukrishnan","year":"2003","journal-title":"In ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/543614.543615"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50048-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50037-8"},{"journal-title":"Proc Workshop on Management and Processing of Data Streams (MPDS)","year":"2003","key":"ref2"},{"key":"ref9","article-title":"Estimating dominance norms of multiple data streams","volume":"2838","author":"cormode","year":"2003","journal-title":"LNCS"},{"journal-title":"Internet Traffic Archive","year":"0","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509966"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129079"},{"key":"ref21","article-title":"QuickSAND: Quick summary and analysis of network data","author":"gilbert","year":"2001","journal-title":"Technical Report 2001-43"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892082"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0222080"},{"journal-title":"Sketch-based Change Detection Methods Evaluation and Applications","year":"2003","author":"krishnamurthy","key":"ref25"}],"event":{"name":"IEEE INFOCOM 2004","acronym":"INFCOM-04","location":"Hong Kong, PR China"},"container-title":["IEEE INFOCOM 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9369\/29752\/01354567.pdf?arnumber=1354567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T13:42:56Z","timestamp":1497620576000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1354567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/infcom.2004.1354567","relation":{},"subject":[]}}