Sciweavers

73 search results - page 7 / 15
» On the false-positive rate of Bloom filters
Sort
View
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
INFOCOM
2010
IEEE
13 years 5 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
IJACTAICIT
2010
123views more  IJACTAICIT 2010»
13 years 4 months ago
A Hybrid Fault-Proneness Detection Approach Using Text Filtering and Static Code Analysis
We have proposed a fault-prone software module detection method using text-filtering approach, called Fault-proneness filtering. Even though the fault-proneness filtering achieved...
Osamu Mizuno, Hideaki Hata
ICALP
2005
Springer
14 years 26 days ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 8 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...