369 search results - page 9 / 74 » Scalable Bloom Filters |
ARCS
2006
Springer
14 years 5 days ago
2006
Springer
As applications tend to grow more complex and use more memory, the demand for cache space increases. Thus embedded processors are inclined to use larger caches. Predicting a miss i...
IWNAS
2006
IEEE
14 years 2 months ago
2006
IEEE
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
ACSAC
2008
IEEE
13 years 10 months ago
2008
IEEE
Much effort has been expended in recent years to create large sets of hash codes from known files. Distributing these sets has become more difficult as these sets grow larger. Mea...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—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...