Results 201 to 210 of about 3,836,696 (241)
Some of the next articles are maybe not open access.
On the Prerequisite of Coprimes in Double Hashing
, 2019Hashing is a widely used technique for performing dictionary operations. Even though it is selected from the problem of collision, alternative hashing technique, open addressing has been developed. One such open addressing scheme, double hashing uses two hash functions to perform the search.
Vivek Kumar
semanticscholar +2 more sources
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
Remainder Quotient Double Hashing Technique in Closed Hashing Search Process
SSRN Electronic Journal, 2019Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
S. Pandey, A. Agarwal
semanticscholar +2 more sources
DOUBLE HASHING WITH MULTIPLE PASSBITS
International Journal of Foundations of Computer Science, 2003We 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
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
Double-Coding Density Sensitive Hashing
International Conference on Neural Information Processing, 2017This 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 +4 more
semanticscholar +2 more sources
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
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
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
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. Almutairi +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.
Ewan Fleischmann +3 more
openaire +1 more source