Results 21 to 30 of about 168,960 (287)
Locality-Sensitive Hashing for Information Retrieval System on Multiple GPGPU Devices
Applied Sciences, 2020 It is challenging to build a real-time information retrieval system, especially for systems with high-dimensional big data. To structure big data, many hashing algorithms that map similar data items to the same bucket to advance the search have been ...
Toan Nguyen Mau, Yasushi Inoguchi
doaj +1 more source
Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2015 In this paper, we conducted empirical experiments to study the performance of hashing with a large set of data and compared the results of different collision approaches. The experiment results leaned more to closed addressing than to open addressing and
Dapeng Liu, Shaochun Xu
doaj +1 more source
ACM Transactions on Parallel Computing, 2016 Concurrent hash tables are one of the most important concurrent data structures, which are used in numerous applications. For some applications, it is common that hash table accesses dominate the execution time. To efficiently solve these problems in parallel, we need implementations that achieve speedups in highly concurrent scenarios.
Maier, T., Sanders, P., Dementiev, R.
openaire +4 more sources
Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022 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
Transactions on Cryptographic Hardware and Embedded Systems, 2021 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
An Indictment of Bright Line Tests for Honest Services Mail Fraud [PDF]
, 2004 Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is widely used in areas ranging from traditional numerical applications to recent big data analysis and machine learning.
Azad, A +3 more
core +3 more sources
CAAI Transactions on Intelligence Technology, EarlyView., 2023 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
IEEE Access, 2020 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
CHAP : Enabling efficient hardware-based multiple hash schemes for IP lookup [PDF]
, 2008 Building a high performance IP lookup engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP tables.
Cho, S +3 more
core +5 more sources
CoRR, 2021 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