Streaming algorithms for network flow data analysis

作者： Ashwin Lall

DOI:

关键词:

摘要:

暂无可下载资源，当前可以选择系统获取到有开放资源时通知我或者直接发起求助文献求助

参考文章(78)

Moses Charikar, Kevin Chen, Martin Farach-Colton, Finding Frequent Items in Data Streams international colloquium on automata languages and programming. ,vol. 312, pp. 693- 703 ,(2002) , 10.1016/S0304-3975(03)00400-6

Zhuoqing Morley Mao, Jia Wang, Ying Zhang, Low-Rate TCP-Targeted DoS Attack Disrupts Internet Routing. network and distributed system security symposium. ,(2007)

Hossein Jowhari, Mohammad Ghodsi, New streaming algorithms for counting triangles in graphs computing and combinatorics conference. pp. 710- 716 ,(2005) , 10.1007/11533719_72

Martin Raab, Angelika Steger, Balls into Bins - A Simple and Tight Analysis randomization and approximation techniques in computer science. pp. 159- 170 ,(1998) , 10.1007/3-540-49543-6_13

Shobha Venkataraman, Dawn Song, Phillip B. Gibbons, Avrim Blum, New Streaming Algorithms for Fast Detection of Superspreaders network and distributed system security symposium. ,(2004) , 10.21236/ADA461026

Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan, Estimating entropy and entropy norm on data streams symposium on theoretical aspects of computer science. ,vol. 3, pp. 196- 205 ,(2006) , 10.1007/11672142_15

Lakshminath Bhuvanagiri, Sumit Ganguly, Estimating Entropy over Data Streams Lecture Notes in Computer Science. pp. 148- 159 ,(2006) , 10.1007/11841036_16

Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro, Frequency Estimation of Internet Packet Streams with Limited Space european symposium on algorithms. pp. 348- 360 ,(2002) , 10.1007/3-540-45749-6_33

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, Luca Trevisan, Counting Distinct Elements in a Data Stream randomization and approximation techniques in computer science. pp. 1- 10 ,(2002) , 10.1007/3-540-45726-7_1