Results 171 to 180 of about 1,687 (211)

Another Glance at Double-Length Hashing

, 2009
We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use one or two calls to a 2n -bit key, n -bit block blockcipher.
Onur Özen, Martijn Stam
openaire   +2 more sources

External Double Hashing with Choice

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2006
A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical results demonstrate the reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket ...
W.A. Burkhard
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Robust Video Hashing Based on Double-Layer Embedding

IEEE Signal Processing Letters, 2011
A robust video hashing scheme for video content identification and authentication is proposed, which is called Double-Layer Embedding scheme. Intra-cluster Locally Linear Embedding (LLE) and inter-cluster Multi-Dimensional Scaling (MDS) are used in the scheme.
Xiushan Nie, Ju Liu, Jiande Sun
exaly   +2 more sources

Double-Coding Density Sensitive Hashing

, 2017
This paper proposes a double-coding density sensitive hashing (DCDSH) method. DCDSH accomplishes approximate nearest neighbor (ANN) search tasks based on its double coding scheme. First, DCDSH generates real-valued hash codes by projecting objects along the principle hyper-planes.
Xiaoliang Tang, Xing Wang 0002, Di Jia, Weidong Song, Xiangfu Meng   +4 more
openaire   +2 more sources

Frequent Itemset Generation using Double Hashing Technique

Procedia Engineering, 2012
In data mining, frequent itemsets plays an important role which is used to identify the correlations among the fields of database.In this paper, we propose a new association rule mining algorithm called Double Hashing Based Frequent Itemsets, (DHBFI) in ...
V Vidhya, M Krishnamurthy, A Kannan
exaly   +2 more sources

K-means based double-bit quantization for hashing

2014 IEEE Symposium on Computational Intelligence for Multimedia, Signal and Vision Processing (CIMSIVP), 2014
Hashing function is an efficient way for nearest neighbor search in massive dataset because of low storage cost and low computational cost. However, it is NP hard problem to transform data points from the original space into a new hypercube space directly. Typically, the most of hashing methods choose a two-stage strategy. In the first stage, dimension
exaly   +2 more sources

DOUBLE HASHING WITH MULTIPLE PASSBITS

International Journal of Foundations of Computer Science, 2003
We present a novel extension to passbits providing significant reduction to unsuccessful search lengths for open addressing collision resolution hashing. Both the experimental and analytical results presented demonstrate the dramatic reductions possible.
Paul M. Martini, Walter A. Burkhard
openaire   +2 more sources

Double Hashing

, 1990
Charles Lins
openaire   +2 more sources

Double Hashing

, 2010
Alan G Konheim
exaly   +2 more sources

Double hashing

Journal of the American Society for Information Science, 1972
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire   +1 more source