Sciweavers

8 search results - page 1 / 2
» An Improved Construction for Counting Bloom Filters
Sort
View
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 7 months ago
An Improved Construction for Counting Bloom Filters
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...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
INFOCOM
2012
IEEE
11 years 6 months ago
The Bloom paradox: When not to use a Bloom filter?
—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...
Ori Rottenstreich, Isaac Keslassy
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
13 years 9 months ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
INFOCOM
2012
IEEE
11 years 6 months ago
The Variable-Increment Counting Bloom Filter
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
Ori Rottenstreich, Yossi Kanizo, Isaac Keslassy
ICIP
2010
IEEE
13 years 1 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