Results 171 to 180 of about 20,383 (214)

The analysis of double hashing(Extended Abstract)

Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976
In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemeredi
openaire   +1 more source

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, Di Jia, Weidong Song, Xiangfu Meng   +4 more
openaire   +1 more source

Deep Double Center Hashing for Face Image Retrieval

2021
Hashing is an effective and widely used technology for fast approximate nearest neighbor search in large-scale images. In recent years, it has been combined with a powerful feature learning model, convolutional neural network(CNN), to boost the efficiency of large-scale image retrieval. In this paper, we introduce a new Deep Double Center Hashing (DDCH)
Xin Fu, Wenzhong Wang, Jin Tang
openaire   +1 more source

Collision Resistant Double-Length Hashing

2010
We give collision resistance bounds for blockcipher based, double-call, double-length hash functions using (k, n)-bit blockciphers with k > n. Ozen and Stam recently proposed a framework [21] for such hash functions that use 3n-to-2n-bit compression functions and two parallel calls to two independent blockciphers with 2n-bit key and n-bit block size.
Ewan Fleischmann, Christian Forler, Michael Gorski, Stefan Lucks   +3 more
openaire   +1 more source

An Efficient, Hybrid, Double-Hash StringMatching Algorithm

2019 IEEE Long Island Systems, Applications and Technology Conference (LISAT), 2019
In this paper we show that combining some of the good features of the existing popular algorithms can be even more efficient. This new algorithm is hybrid as it employs features from Boyer-Moore-Horspool, Rabin-Karp and Raita algorithms. We compare the right most character as well as use two independent hash functions and no character by character ...
Mehmet Bicer, Xiaowen Zhang
openaire   +1 more source

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 ...
openaire   +1 more source

Evolutionary double-pipe prefix-free hash function

Journal of Information and Optimization Sciences, 2020
Recent works have presented collision attacks based on differentiability of classical hash functions. In this article a new hash function is proposed with enhanced Merkle-Damgard construction.
openaire   +1 more source

Double hash function scheme in wireless sensor networks

2011 World Congress on Information and Communication Technologies, 2011
Wireless sensor networks are a new class of distributed systems that are an integral part of the physical space they inhabit. Key distribution plays an important role in wireless sensor networks. In WSN, node capture attack is the most series attack. The aim of this paper is to improve the resistance against the node capture attack.
T.D. Subash, C. Divya
openaire   +1 more source

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   +1 more source

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.
null Xiushan Nie, null Ju Liu, null Jiande Sun, null Wei Liu   +3 more
openaire   +1 more source