Results 21 to 30 of about 167,829 (332)
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
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
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
A Distributed Hash Table for Shared Memory [PDF]
, 2015 Distributed algorithms for graph searching require a high-performance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before.
Dijk, Tom van +2 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
Distributed Paged Hash Tables [PDF]
, 2003 In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very ...
Rufino, José +3 more
openaire +2 more sources
An Improved Algorithm of Philips Audio Fingerprint Retrieval [PDF]
Jisuanji gongcheng, 2018 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
Advances in Mechanical Engineering, 2019 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
Dynamic Graphs on the GPU [PDF]
, 2020 We present a fast dynamic graph data structure for the GPU. Our dynamic graph structure uses one hash table per vertex to store adjacency lists and achieves 3.4–14.8x faster insertion rates over the state of the art across a diverse set of large datasets,
Ashkiani, Saman +3 more
core +1 more source
On the Scalability of the GPUexplore Explicit-State Model Checker [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 The use of graphics processors (GPUs) is a promising approach to speed up model checking to such an extent that it becomes feasible to instantly verify software systems during development.
Nathan Cassee, Thomas Neele, Anton Wijs
doaj +1 more source