Results 191 to 200 of about 2,157,663 (242)
Some of the next articles are maybe not open access.

Deep Double Center Hashing for Face Image Retrieval

Chinese Conference on Pattern Recognition and Computer Vision, 2021
Hashing is an effective and widely used technology for fast approximate nearest neighbor search in large-scale images. In recent years, it has been combined with a powerful feature learning model, convolutional neural network(CNN), to boost the efficiency of large-scale image retrieval. In this paper, we introduce a new Deep Double Center Hashing (DDCH)
Xin Fu, Wenzhong Wang, Jin Tang
openaire   +2 more sources

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 ...
W. Burkhard
openaire   +2 more sources

Double-Coding Density Sensitive Hashing

International Conference on Neural Information Processing, 2017
This 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
openaire   +2 more sources

On the Prerequisite of Coprimes in Double Hashing

2019
Hashing 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
openaire   +2 more sources

Density-Based Clustering by Double-Bit Quantization Hashing

Communications in Computer and Information Science, 2019
Grouping 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   +2 more sources

Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles

open access: closedCryptography and Communications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yusuke Naito
openalex   +3 more sources

Deep Learning-Based Image Retrieval With Unsupervised Double Bit Hashing

IEEE transactions on circuits and systems for video technology (Print), 2023
Unsupervised 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), 2023
Cloud 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

DOUBLE HASHING WITH MULTIPLE PASSBITS

International Journal of Foundations of Computer Science, 2003
We 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.
Martini, Paul M., Burkhard, Walter A.
openaire   +2 more sources

Average Approximate Hashing-Based Double Projections Learning for Cross-Modal Retrieval

IEEE Transactions on Cybernetics, 2021
Cross-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

Home - About - Disclaimer - Privacy