17 search results - page 2 / 4 » The Variable-Increment Counting Bloom Filter |
ISLPED
2009
ACM
13 years 12 months ago
2009
ACM
The design trend of caches in modern processors continues to increase their capacity with higher associativity to cope with large data footprint and take advantage of feature size...
ESA
2006
Springer
13 years 9 months ago
2006
Springer
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
ICIP
2010
IEEE
13 years 3 months ago
2010
IEEE
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 ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—In this paper, we uncover the Bloom paradox in Bloom filters: sometimes, it is better to disregard the query results of Bloom filters, and in fact not to even query them, thus...
SIGCOMM
2006
ACM
13 years 11 months ago
2006
ACM
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 ...