19 search results - page 2 / 4 » A Memory-Optimized Bloom Filter Using an Additional Hashing ... |
TPDS
2010
13 years 2 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
GLOBECOM
2008
IEEE
13 years 5 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
SODA
2004
ACM
13 years 6 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
PDCN
2007
13 years 6 months ago
2007
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
IJSN
2007
13 years 4 months ago
2007
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...