Results 201 to 210 of about 2,100,258 (259)
Some of the next articles are maybe not open access.
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
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
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
Double-Bit Quantization and Index Hashing for Nearest Neighbor Search
IEEE transactions on multimedia, 2019As 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 +5 more
semanticscholar +1 more source
Collision Resistant Double-Length Hashing
2010We 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.
Stefan Lucks +3 more
openaire +2 more sources