Results 1 to 10 of about 2,157,663 (242)

Double hashing with passbits

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Multi-View Double Alignment Hashing Network with Weighted Contrastive Learning

IEEE International Conference on Multimedia and Expo
Multi-view retrieval faces significant pressure due to the rapidly increasing multi-view information on the internet. The multi-view hashing method turns continuous features into compact information of fixed length and considerably improves retrieval ...
Tianlong Zhang, Zhe Xue, Yuchen Dong, Junping Du, Meiyu Liang   +4 more
semanticscholar   +1 more source

High Dimensional Massive Data Processing Based on Locality-Sensitive Hashing and Double-Layer Skiplist

International Conference on Intelligent Transportation, Big Data and Smart City, 2020
When processing the high-dimension and massive data collected in the production process of ultra-precision machining tool, there is the issue of low efficiency in query operation of multi-key query and time range.
Yuxuan Ma, Xin Hao, Shenghui Liu, Haining Yu, Chao Ma   +4 more
semanticscholar   +1 more source

Double Cancelable Hashing for Protecting Biometrics of Users in Crowd

International Conference on Computing for Sustainable Global Development
Smart gates are considered one of the most important methods for managing crowds. Often, methods of authentication and verification of users depend on the user’s biometric fingerprints, such as hand or eye prints.
M. M. Almutairi, Dimitra Apostolopoulou, David Stupples, A. A. Sen, Mohammad Yamin, George D. Halikias   +5 more
semanticscholar   +1 more source

Double-Bit Quantization and Index Hashing for Nearest Neighbor Search

IEEE transactions on multimedia, 2019
As binary code is storage efficient and fast to compute, it has become a trend to compact real-valued data to binary codes for the nearest neighbors (NN) search in a large-scale database.
Hongtao Xie, Zhendong Mao, Yongdong Zhang, Han Deng, C. Yan, Zhineng Chen   +5 more
semanticscholar   +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

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

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