165 search results - page 6 / 33 » Theory and Network Applications of Dynamic Bloom Filters |
ANCS
2005
ACM
14 years 1 months ago
2005
ACM
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
IJISEC
2006
13 years 7 months ago
2006
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...
TON
2002
13 years 7 months ago
2002
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
UAI
2000
13 years 9 months ago
2000
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...