IM
2007
13 years 4 months ago
2007
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
MICRO
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper describes several methods for improving the scalability of memory disambiguation hardware for future high ILP processors. As the number of in-flight instructions grows...
RTSS
2005
IEEE
13 years 10 months ago
2005
IEEE
A novel gradient-ascending stateless routing protocol, called GRASP (GRadient Ascending Stateless Protocol), is proposed for stationary wireless sensor networks. GRASP is built wi...
ISVLSI
2006
IEEE
13 years 10 months ago
2006
IEEE
Many network security applications require large virus signature sets to be maintained, retrieved, and compared against the network streams. Software applications frequently fail ...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
ICPP
2006
IEEE
13 years 10 months ago
2006
IEEE
Recently, Bloom filters have been widely used in distributed systems where they are replicated to process distributed queries. Bloom filter replicas become stale in a dynamic en...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
Copy-move forgery is a specific type of image tampering, where a part of the image is copied and pasted on another part of the same image. In this paper, we propose a new approac...