Sciweavers

101 search results - page 12 / 21
» The Bloom paradox: When not to use a Bloom filter
Sort
View
GLOBECOM
2008
IEEE
13 years 9 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
CSEE
2009
Springer
14 years 3 months ago
Evaluating Software Inspection Cognition Levels Using Bloom's Taxonomy
This paper reports on results from a pilot study that used Bloom’s Taxonomy to observe cognition levels during software inspections conducted by undergraduate computer science a...
David A. McMeekin, Brian R. von Konsky, Elizabeth ...
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 8 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
INFOCOM
2010
IEEE
13 years 6 months ago
Tracking Long Duration Flows in Network Traffic
We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have hi...
Aiyou Chen, Yu Jin, Jin Cao
ICCD
2006
IEEE
103views Hardware» more  ICCD 2006»
14 years 5 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