19 search results - page 3 / 4 » A Memory-Optimized Bloom Filter Using an Additional Hashing ... |
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Bloom filters allow membership queries over sets with allowable errors. It is widely used in databases, networks and distributed systems and it has great potential for distribut...
ACSAC
2008
IEEE
13 years 6 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...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
SIGCOMM
2006
ACM
13 years 10 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 ...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...