Sciweavers

306 search results - page 16 / 62
» Compressed bloom filters
Sort
View
DIALM
2011
ACM
274views Algorithms» more  DIALM 2011»
12 years 11 months ago
Low complexity set reconciliation using Bloom filters
Magnus Skjegstad, Torleiv Maseng
AUTOMATICA
2007
76views more  AUTOMATICA 2007»
13 years 7 months ago
Fault-tolerant compression filters by time-propagated measurement fusion
For fault-tolerant real-time filtering, an efficient two-filter architecture is proposed. In the two-filter architecture, a host filter is operated permanently. A compression filt...
Hyung Keun Lee, Jang Gyu Lee
ICIP
2010
IEEE
13 years 5 months ago
Rotation robust detection of copy-move forgery
Copy-move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place to add or remove an object. In this paper, an efficient ...
Weihai Li, Nenghai Yu
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 7 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
ICCD
2006
IEEE
103views Hardware» more  ICCD 2006»
14 years 4 months ago
Architectural Support for Run-Time Validation of Control Flow Transfer
—Current micro-architecture blindly uses the address in the program counter to fetch and execute instructions without validating its legitimacy. Whenever this blind-folded instru...
Yixin Shi, Sean Dempsey, Gyungho Lee