The trend toward networks becoming larger and faster, and addresses increasing in size, has impelled a need to explore alternatives for fast address recognition. Hashing is one such alternative which can help minimize the address search time in adapters, bridges, routers, gateways, and name servers. Using a trace of address references, we compared the e ciency of several di erent hashing functi...

Abstract Minwise hashing is a standard technique in the context of search for efficiently computing set similarities. The recent development of b-bit minwise hashing provides a substantial improvement by storing only the lowest b bits of each hashed value. In this paper, we demonstrate that b-bit minwise hashing can be naturally integrated with linear learning algorithms such as linear SVM and ...

E-mail: [email protected] Abstract: Several hashing-based methods for Approximate Nearest Neighbors (ANN) search in a large data set have been proposed recently. In particular, semi-supervised hashing utilizes semantic similarity given for a small fraction of pairwise data samples and active hashing aims to improve the performance for ANN search by relying on an expert for the labeling of the...

Image hashing is a novel technology of multimedia and finds many applications such as image retrieval, image copy detection, digital watermarking and image indexing. This paper proposes a multiple histograms based image hashing, which can reach an acceptable trade-off between rotation robustness and discrimination. The proposed hashing is done by converting the input image into a normalized ima...

Robin Hood hashing is a variation on open addressing hashing designed to reduce the maximum search time as well as the variance in the search time for elements in the hash table. While the case of insertions only using Robin Hood hashing is well understood, the behavior with deletions has remained open. Here we show that Robin Hood hashing can be analyzed under the framework of finite-level fin...

We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG based hashing, this technique gives a new hashing algorithm. ...