Results 21 to 30 of about 1,534,598 (250)
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
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
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
EFFICIENT SELF-ADJUSTING HASH TABLE [PDF]
, 2015 Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for an efficient self-adjusting hash table. An aspect may include hash tables that include hints that describe where objects may be found in the hash table.
Lebar, Justin, Pike, Geoffrey
core +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
Near perfect hash table for image databases [PDF]
, 1996 In image database systems, a perfect hash table can be used to enhance the efficiency and effectiveness of the image retrieval process. In our earlier work, we have proposed heuristic algorithms to compute the minimal perfect hash table from symbolic ...
Chaman L. Sabharwal +3 more
core +1 more source
A Parallel Compact Hash Table [PDF]
, 2011 We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic region-based locking scheme with only a fraction of the memory requirements of a regular hash ...
Laarman, Alfons +3 more
core +1 more source
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
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