Results 21 to 30 of about 2,157,663 (242)
Remainder Quotient Double Hashing Technique in Closed Hashing Search Process
Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
Stuti Pandey, Abhay Kumar Agarwal
semanticscholar +3 more sources
The analysis of double hashing(Extended Abstract) [PDF]
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
Quantum Collision Resistance of Double-Block-Length Hashing
SUMMARY In 2005, Nandi introduced a class of double-block-length compression functions h π ( x ) : = ( h ( x ) , h ( π ( x ))) , where h is a random oraclewithan n -bitoutputand π isanon-cryptographicpublicpermutation.
Shoichi Hirose, Hidenori KUWAKADO
semanticscholar +4 more sources
Double-Hashing Algorithm for Frequency Estimation in Data Streams [PDF]
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.
Nikita Seleznev +2 more
openalex +3 more sources
Model Size Reduction Using Frequency Based Double Hashing for Recommender Systems [PDF]
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.
Caojin Zhang +12 more
openalex +3 more sources
Frequent Itemset Generation using Double Hashing Technique
AbstractIn data mining, frequent itemsets plays an important role which is used to identify the correlations among the fields of database.In this paper, we propose a new association rule mining algorithm called Double Hashing Based Frequent Itemsets, (DHBFI) in which hashing technology is used to store the database in vertical data format.
N. Jayalakshmi +3 more
semanticscholar +3 more sources
The Cost of Bitcoin Mining Has Never Really Increased [PDF]
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 +4 more sources
Attacks on Fast Double Block Length Hash Functions [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lars R. Knudsen +2 more
openalex +2 more sources
Some Attacks Against a Double Length Hash Proposal [PDF]
At FSE 2005, Nandi et al proposed a method to turn an n-bit compression function into a 2n-bit compression function. In the black-box model, the security of this double length hash proposal against collision attacks is proven, if no more than Ω(22n/3) oracle queries to the underlying n-bit function are made.
Lars R. Knudsen, Frédéric Muller
+6 more sources
Quantum-inspired improved African vultures optimization algorithm for efficient placement of IoT service in edge computing environment [PDF]
The emergence of 5G networks has led to development of Edge Computing (EC) environments, which offer improved support for applications that rely on the Internet of Things (IoT).
B. Panjavarnam +3 more
doaj +2 more sources

