Results 31 to 40 of about 1,500,333 (340)

A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression

open access: yesIEEE Access, 2020
LZ77 is a dictionary compression algorithm by replacing the repeating sequence with the addresses of the previous referenced data in the stream. To find out these repetition, the LZ77 encoder maintains a hashing table, which have to frequently calculate ...
Hao Jiang, Sian-Jheng Lin
doaj   +1 more source

Locality-Sensitive Hashing for Information Retrieval System on Multiple GPGPU Devices

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

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

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

PaCHash: Packed and Compressed Hash Tables

open access: yes, 2023
We introduce PaCHash, a hash table that stores its objects contiguously in an array without intervening space, even if the objects have variable size. In particular, each object can be compressed using standard compression techniques. A small search data structure allows locating the objects in constant expected time.
Kurpicz, Florian   +2 more
openaire   +4 more sources

Formal Cyclopropylation of Imines with Cyclopropanols: Stereocontrolled Access to Conformationally Constrained γ‐Amino Alcohols

open access: yesAngewandte Chemie, EarlyView.
A formal cyclopropylation of imines with cyclopropanols enables stereoselective access to cyclopropane‐embedded γ‐amino alcohols bearing three contiguous stereocenters. The transformation proceeds through a sequence of Mannich‐type addition and ring closure involving enolized zinc homoenolate, and is applicable to both N‐sulfonyl and chiral N‐sulfinyl ...
Kento Tsukiji   +3 more
wiley   +2 more sources

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   +3 more sources

User privacy prevention model using supervised federated learning‐based block chain approach for internet of Medical Things

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

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

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