Results 21 to 30 of about 24,134 (254)
Most cloud services and distributed applications rely on hashing algorithms that allow dynamic scaling of a robust and efficient hash table. Examples include AWS, Google Cloud and BitTorrent. Consistent and rendezvous hashing are algorithms that minimize key remapping as the hash table resizes.
Mike Heddes +4 more
openaire +2 more sources
Time-Memory Analysis of Parallel Collision Search Algorithms
Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks.
Monika Trimoska +2 more
doaj +1 more source
Hash Tables for a Digital Lexicon [PDF]
This paper deals with the construction of digital lexicons within the scope of Natural Language Processing. Data Structures called Hash Tables have demonstrated to generate good results for Natural Language Interface for Databases and have data dispersion, response speed and programming simplicity as main features.
Fábio Carlos Moreno +2 more
openaire +2 more sources
Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
Image Encryption Based on Hash Table Scrambling and DNA Substitution
This paper proposes an image encryption algorithm based on hash table structure scrambling and DNA substitution. The algorithm uses the classical `scrambling-diffusion' process, and the pseudo-random sequence used in each process is generated by the ...
Xingyuan Wang, Lin Liu
doaj +1 more source
We revisit the problem of building static hash tables on the GPU and design and build three bucketed hash tables that use different probing schemes. Our implementations are lock-free and offer efficient memory access patterns; thus, only the probing scheme is the factor affecting the performance of the hash table's different operations.
Muhammad A. Awad +4 more
openaire +2 more sources
Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network
Abstract Sixth Generation (6G) integrates the next generation communication systems such as maritime, terrestrial, and aerial to offer robust network and massive device connectivity with ultra‐low latency requirement. The cutting edge technologies such as artificial intelligence, quantum machine learning, and millimetre enable hyper‐connectivity to ...
Deebak Bakkiam David, Fadi Al‐Turjman
wiley +1 more source
An Improved Algorithm of Philips Audio Fingerprint Retrieval [PDF]
In the Philips audio fingerprint retrieval algorithm,the construction of a query table as an index,which limits the application due to excessive memory consumption.For this reason,an improved algorithm is proposed based on Philips audio fingerprint ...
SUN Ning,ZHAO Weiping,HEN Mei,LI Chao
doaj
Semi-supervised hash learning method with consistency-based dimensionality reduction
With the explosive growth of surveillance data, exact match queries become much more difficult for its high dimension and high volume. Owing to its good balance between the retrieval performance and the computational cost, hash learning technique is ...
Fang Lv +3 more
doaj +1 more source
Trigonometric words ranking model for spam message classification
Abstract The significant increase in the volume of fake (spam) messages has led to an urgent need to develop and implement a robust anti‐spam method. Several of the current anti‐spam systems depend mainly on the word order of the message in determining the spam message, which results in the system's inability to predict the correct type of message when
Suha Mohammed Hadi +7 more
wiley +1 more source

