Sciweavers

990 search results - page 41 / 198
» An efficient data structure for network anomaly detection
Sort
View
IJISEC
2006
119views more  IJISEC 2006»
13 years 8 months ago
A monitoring system for detecting repeated packets with applications to computer worms
Abstract We present a monitoring system which detects repeated packets in network traffic, and has applications including detecting computer worms. It uses Bloom filters with count...
Paul C. van Oorschot, Jean-Marc Robert, Miguel Var...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 9 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ICIP
2006
IEEE
14 years 9 months ago
Hierarchical Data Structure for Real-Time Background Subtraction
This paper seeks to increase the efficiency of background subtraction algorithms for motion detection. Our method uses a quadtree-base hierarchical framework that samples a small ...
Johnny Park, Amy Tabb, Avinash C. Kak
CCS
2004
ACM
14 years 1 months ago
Web tap: detecting covert web traffic
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
Kevin Borders, Atul Prakash
KDD
2003
ACM
192views Data Mining» more  KDD 2003»
14 years 8 months ago
Efficient elastic burst detection in data streams
Burst detection is the activity of finding abnormal aggregates in data streams. Such aggregates are based on sliding windows over data streams. In some applications, we want to mo...
Yunyue Zhu, Dennis Shasha