Results 21 to 30 of about 169,343 (316)

Time-Memory Analysis of Parallel Collision Search Algorithms

open access: yesTransactions 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]

open access: yes, 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

Image Encryption Based on Hash Table Scrambling and DNA Substitution

open access: yesIEEE 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

Distributed Paged Hash Tables [PDF]

open access: yes, 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

A Distributed Hash Table for Shared Memory [PDF]

open access: yes, 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

Dynamic Graphs on the GPU [PDF]

open access: yes, 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

An Improved Algorithm of Philips Audio Fingerprint Retrieval [PDF]

open access: yesJisuanji 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

open access: yesAdvances 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

Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network

open access: yesIET Networks, EarlyView., 2022
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

On the Scalability of the GPUexplore Explicit-State Model Checker [PDF]

open access: yesElectronic 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

Home - About - Disclaimer - Privacy