Searching for "On the false-positive rate of Bloom filters." – sorted by Relevance.
-
On the false-positive rate of Bloom filters
- ON THE FALSE-POSITIVE RATE OF BLOOM FILTERS Prosenjit Bose Hua Guo Evangelos Kranakis Anil
- Cited by 3 (0 self) – Add To MetaCart
-
Fast Packet Classification Using Bloom Filters
- on the false positive rate of the Bloom filters. Each memory access is just 256 bits, making it practical
- Cited by 3 (0 self) – Add To MetaCart
-
Network Applications of Bloom Filters: A Survey
- constant, if we use n · j bits for the table, optimal Bloom filters will yield a false positive rate
- Cited by 155 (11 self) – Add To MetaCart
-
Enhancing Signature-based Collaborative Spam Detection with Bloom Filters
- of B[hk(y)]. Nonetheless, the false positive rate of Bloom filters observed in simulations matched well
- Cited by 1 (1 self) – Add To MetaCart
-
FRTR: A scalable mechanism to restore routing table consistency
- the false-positive rate in the Bloom filter digests. To overcome this limitation, we “salt” the digests
- Cited by 2 (1 self) – Add To MetaCart
-
The problem domain of Collaborative Intrusion
- Bloom filters by simply binary-ORing them together (at the cost of a higher false-positive rate). Bloom
- Add To MetaCart
-
Snort offloader: A reconfigurable hardware nids filter
- the string and the meta-string, the false positive rate of Bloom Filters is lowered and the amount of traffic
- Cited by 6 (0 self) – Add To MetaCart

