Results 21 to 30 of about 23,863 (307)
An Improved Algorithm of Philips Audio Fingerprint Retrieval [PDF]
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
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]
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
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
SAHA: A String Adaptive Hash Table for Analytical Databases
Hash tables are the fundamental data structure for analytical database workloads, such as aggregation, joining, set filtering and records deduplication. The performance aspects of hash tables differ drastically with respect to what kind of data are being
Tianqi Zheng, Zhibin Zhang, Xueqi Cheng
doaj +1 more source
Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, firewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory
openaire +2 more sources
Abstract : Some variants of the traditional hash method, making use of the numerical or alphabetical order of the keys, lead to faster searching at the expense of a little extra work when items are inserted. The paper presents the new algorithms and analyzes their average running time. (Author)
Amble, O., Knuth, D. E.
openaire +2 more sources
Research of a Scheduling Optimization algorithm based on Hash Adapter
The performance of hash-based Scheduling optimization algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting Hash ...
Yang Wenchuan, Fu Zhen, Zuo Wen
doaj +1 more source
ESH: Design and Implementation of an Optimal Hashing Scheme for Persistent Memory
Recent advancements in memory technology have opened up a wealth of possibilities for innovation in data structures. The emergence of byte-addressable persistent memory (PM) with its impressive capacity and low latency has accelerated the adoption of PM ...
Dereje Regassa +2 more
doaj +1 more source
Novel distributed Hash table——BChord
A novel distributed Hash table(DHT) BChord was presented. BChord adopts bi-directional search mechanism of Chord. Though query items of finger table in BChord almost double to Chord, compared with Chord, BChord evi- dently increases speed at searching of
ZHENG Yan1 +3 more
doaj +2 more sources

