Results 1 to 10 of about 65,400 (237)
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. For balanced allocations, keys are hashed into a hash table where each bucket can hold multiple keys, and each key is ...
Michael Mitzenmacher
arxiv +8 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 +2 more
arxiv +5 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 +12 more
arxiv +5 more sources
Balanced allocations and double hashing [PDF]
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014 Further updated, small improvements/typos ...
Michael Mitzenmacher
openalex +3 more sources
Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time [PDF]
arXiv, 2006 In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables.
Shaohua Li
arxiv +3 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 +2 more
doaj +3 more sources
An Efficient Retrieval System Framework for Fabrics Based on Fine-Grained Similarity [PDF]
Entropy, 2022 In the context of “double carbon”, as a traditional high energy consumption industry, the textile industry is facing the severe challenges of energy saving and emission reduction.
Jun Xiang, Ruru Pan, Weidong Gao
doaj +2 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 +3 more
doaj +2 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 +2 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
openalex +2 more sources