Results 211 to 220 of about 20,342 (243)
Some of the next articles are maybe not open access.

On optimal arrangements of keys with double hashing

Journal of Algorithms, 1985
Summary: Given a set of n keys, the keys are arranged in a hash table of size n such that the worst-case retrieval time is minimized. It is shown that, when double hashing is used, one can, with probability 1-o(1), arrange the keys to achieve a worst-case retrieval time O(log n). This gives a solution to an open problem of \textit{R. L.
openaire   +2 more sources

Density-Based Clustering by Double-Bit Quantization Hashing

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   +1 more source

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.
openaire   +1 more source

Cryptanalysis of Double-trapdoor Hash Function and Multi-Trapdoor Hash Function Schemes

2021 International Conference on Networking and Network Applications (NaNA), 2021
Xu An Wang, Yunxuan Su, Jindan Zhang
openaire   +1 more source

Continuous transition from double-layer to Faradaic charge storage in confined electrolytes

Nature Energy, 2022
Simon Fleischmann   +2 more
exaly  

Microscopic Simulations of Electrochemical Double-Layer Capacitors

Chemical Reviews, 2022
Guillaume Jeanmairet   +2 more
exaly  

Home - About - Disclaimer - Privacy