Results 1 to 10 of about 2,144,279 (214)

More Analysis of Double Hashing for Balanced Allocations [PDF]

arXiv, 2015
With double hashing, for a key $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +i g(x)) \bmod n$ for $i=0,1,2,...$ to generate multiple hash values in the range $[0,n-1]$ from the initial two.
Mitzenmacher, Michael
core   +10 more sources

Balanced Allocations and Double Hashing [PDF]

Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N., Dillinger P.C., Heileman G., Mitzenmacher M., Mitzenmacher M., Richa A., Vadhan S., Vvedenskaya N.D.   +7 more
core   +5 more sources

Double-Hashing Algorithm for Frequency Estimation in Data Streams [PDF]

arXiv, 2022
Frequency estimation of elements is an important task for summarizing data streams and machine learning applications. The problem is often addressed by using streaming algorithms with sublinear space data structures. These algorithms allow processing of large data while using limited data storage.
Nikita Seleznev, Annamalai Senthil Kumar, C. Bayan Bruss   +2 more
arxiv   +7 more sources

Model Size Reduction Using Frequency Based Double Hashing for Recommender Systems [PDF]

arXiv, 2020
Deep Neural Networks (DNNs) with sparse input features have been widely used in recommender systems in industry. These models have large memory requirements and need a huge amount of training data. The large model size usually entails a cost, in the range of millions of dollars, for storage and communication with the inference services.
Caojin Zhang, Yicun Liu, Yuanpu Xie, Sofia Ira Ktena, Alykhan Tejani, Akshay Gupta, Pranay Kumar Myana, Deepak Dilipkumar, Suvadip Paul, Ikuhiro Ihara, Prasang Upadhyaya, Ferenc Huszár, Wenzhe Shi   +12 more
arxiv   +7 more sources

Complexity analysis and performance of double hashing sort algorithm [PDF]

Journal of the Egyptian Mathematical Society, 2019
Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics.
Hazem M. Bahig
doaj   +4 more sources

Load thresholds for cuckoo hashing with double hashing [PDF]

16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018
In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects.
Mitzenmacher, Michael, Panagiotou, Konstantinos, Walzer, Stefan   +2 more
core   +6 more sources

Quantum Free-Start Collision Attacks on Double Block Length Hashing with Round-Reduced AES-256

IACR Transactions on Symmetric Cryptology, 2021
Recently, Hosoyamada and Sasaki (EUROCRYPT 2020), and Xiaoyang Dong et al. (ASIACRYPT 2020) proposed quantum collision attacks against AES-like hashing modes AES-MMO and AES-MP.
Amit Kumar Chauhan, Abhishek Kumar, Somitra Kumar Sanadhya   +2 more
doaj   +4 more sources

The Cost of Bitcoin Mining Has Never Really Increased [PDF]

Frontiers in Blockchain, 2020
The Bitcoin network is burning a large amount of energy for mining. In this paper, we estimate the lower bound for the global mining energy cost for a period of 10 years from 2010 to 2020, taking into account changes in energy costs, improvements in ...
Yo-Der Song, Yo-Der Song, Tomaso Aste, Tomaso Aste   +3 more
doaj   +5 more sources

Double hashing technique in closed hashing search process [PDF]

IOP Conference Series: Materials Science and Engineering, 2017
The search process is used in various activities performed both online and offline, many algorithms that can be used to perform the search process one of which is a hash search algorithm, search process with hash search algorithm used in this study using double hashing technique where the data will be formed into the table with same length and then ...
Robbi Rahim, Iskandar Zulkarnain, Hendra Jaya   +2 more
semanticscholar   +4 more sources

The analysis of double hashing(Extended Abstract) [PDF]

Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976
In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search.
Leo J. Guibas, Endre Szemerédi
semanticscholar   +3 more sources