Results 191 to 200 of about 2,100,258 (259)
Some of the next articles are maybe not open access.
Peeling arguments and double hashing
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012The analysis of several algorithms and data structures can be reduced to the analysis of the following greedy “peeling” process: start with a random hypergraph; find a vertex of degree at most k, and remove it and all of its adjacent hyperedges from the graph; repeat until there is no suitable vertex.
Justin Thaler, Michael Mitzenmacher
openaire +3 more sources
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
openaire +3 more sources
Deep Double Center Hashing for Face Image Retrieval
Chinese Conference on Pattern Recognition and Computer Vision, 2021Hashing 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 +3 more sources
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.
Paul M. Martini, Walter A. Burkhard
openalex +2 more sources
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.
Xiangfu Meng +4 more
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
openalex +2 more sources
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