Results 211 to 220 of about 2,148,635 (268)
Some of the next articles are maybe not open access.
A Double Security Hashing Algorithm for Storing Data in Blockchain Technology
2023 7th International Conference on Electronics, Communication and Aerospace Technology (ICECA), 2023Cloud storage is one of the main options for storing massive amounts of data, but the centralized storage method of cloud computing is not secure. On the other hand, blockchain is a decentralized cloud storage system that ensures data security.
G. Subathra +4 more
semanticscholar +1 more source
Average Approximate Hashing-Based Double Projections Learning for Cross-Modal Retrieval
IEEE Transactions on Cybernetics, 2021Cross-modal retrieval has attracted considerable attention for searching in large-scale multimedia databases because of its efficiency and effectiveness.
Xiaozhao Fang +5 more
semanticscholar +1 more source
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 +4 more
semanticscholar +1 more source
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 +4 more
semanticscholar +1 more source
A Multi-View Double Alignment Hashing Network with Weighted Contrastive Learning
IEEE International Conference on Multimedia and ExpoMulti-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 +4 more
semanticscholar +1 more source
Information Processing Letters, 2005
Double hashing with bucket capacity one is augmented with multiple passbits to obtain significant reduction to unsuccessful search lengths. This improves the analysis of Martini et al. [P.M. Martini, W.A. Burkhard, Double hashing with multiple passbits, Internat. J. Found. Theoret. Comput. Sci.
openaire +1 more source
Double hashing with bucket capacity one is augmented with multiple passbits to obtain significant reduction to unsuccessful search lengths. This improves the analysis of Martini et al. [P.M. Martini, W.A. Burkhard, Double hashing with multiple passbits, Internat. J. Found. Theoret. Comput. Sci.
openaire +1 more source
Double Cancelable Hashing for Protecting Biometrics of Users in Crowd
International Conference on Computing for Sustainable Global DevelopmentSmart 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 +5 more
semanticscholar +1 more source
Flexible Packet Matching with Single Double Cuckoo Hash
IEEE Communications Magazine, 2017In modern switches, a packet can go through a number of processing steps to determine, for example, if the packet has to be discarded due to security policies, if it needs to be marked for quality of service or to determine the next hop for the packet.
Levy G, Pontarelli S, Reviriego P
openaire +3 more sources
Evolutionary double-pipe prefix-free hash function [PDF]
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
An Efficient, Hybrid, Double-Hash StringMatching Algorithm
2019 IEEE Long Island Systems, Applications and Technology Conference (LISAT), 2019In 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 +2 more sources