Results 11 to 20 of about 2,100,258 (259)

The analysis of double hashing

Journal of Computer and System Sciences, 1978
AbstractIn this paper we analyze the performance of double hashing, a well-known hashing algorithm in which we probe the hash table along arithmetic progressions where 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   +4 more sources

Frequent Itemset Generation using Double Hashing Technique

Procedia Engineering, 2012
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, V. Vidhya, M. Krishnamurthy, A. Kannan   +3 more
semanticscholar   +4 more sources

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

ACM Conference on Recommender Systems, 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.
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
semanticscholar   +5 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   +4 more sources

HASHING & DOUBLE ENCRYPTION TECHNIQUE FOR INFORMATION STORAGE IN CLOUD

International Journal of Engineering Applied Sciences and Technology, 2022
—Information storage in the cloud is very popular in recent days. The Cloud platform provides various services to its users and one of the important zones of service is the security of the information stored. This project proposes an enhanced approach of
Soorya Kumar S, P Meenakshi, A Subramanyan   +2 more
openalex   +2 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

E-GENMR: Enhanced Generalized Query Processing using Double Hashing Technique through MapReduce in Cloud Database Management System [PDF]

Journal of Computer Science, 2017
Big Data, Cloud computing and Data Science is the booming future of IT industries. The common thing among all the new techniques is that they deal with not just Data but Big Data. Users store various kinds of data on cloud repositories.
Shweta Malhotra, M. N. Doja, Bashir Alam, Mansaf Alam   +3 more
openalex   +2 more sources

Improved Quantum Rebound Attacks on Double Block Length Hashing with Round-Reduced AES-256 and ARIA-256

IACR Transactions on Symmetric Cryptology
At EUROCRYPT 2020, Hosoyamada and Sasaki proposed the first dedicated quantum collision attacks on hash functions. Their proposal presented a quantum adaptation of the rebound attack and revealed that differential trails, which have too low probability ...
Dongjae Lee, Seokhie Hong
doaj   +2 more sources

Quantum Collision Resistance of Double-Block-Length Hashing

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
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
openalex   +3 more sources

Some Attacks Against a Double Length Hash Proposal [PDF]

, 2005
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
openalex   +4 more sources