Results 211 to 220 of about 2,153,801 (273)
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 ...
Walter A. Burkhard
openaire +3 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
Abraham Bookstein
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Density-Based Clustering by Double-Bit Quantization Hashing
Communications in Computer and Information Science, 2019Grouping data into the different parts, while the objects in the same part have the most similarity with each other and cannot belong to the other parts, called data clustering. Clustering used for data analysis in data mining, so far, many different algorithms for clustering have been offered.
Mahdieh Dehghani +2 more
openaire +3 more sources
Deep Learning-Based Image Retrieval With Unsupervised Double Bit Hashing
IEEE transactions on circuits and systems for video technology (Print), 2023Unsupervised image hashing is a widely used technique for large-scale image retrieval. This technique maps an image to a finite length of binary codes without extensive human-annotated data for compact storage and effective semantic retrieval. This study
Jing-Ming Guo +3 more
semanticscholar +1 more source
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
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