Results 31 to 40 of about 168,960 (287)
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
Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network
IET 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]
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
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
Trigonometric words ranking model for spam message classification
IET Networks, EarlyView., 2022 Abstract The significant increase in the volume of fake (spam) messages has led to an urgent need to develop and implement a robust anti‐spam method. Several of the current anti‐spam systems depend mainly on the word order of the message in determining the spam message, which results in the system's inability to predict the correct type of message when
Suha Mohammed Hadi +7 more
wiley +1 more source
SAHA: A String Adaptive Hash Table for Analytical Databases
Applied Sciences, 2020 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
On the Insertion Time of Cuckoo Hashing
, 2013 Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant access times. There, each item can be placed in a location given by any one out of k different hash functions.
Fountoulakis, Nikolaos +2 more
core +1 more source
Weighted distributed hash tables [PDF]
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005 We present two methods for weighted consistent hashing also known as weighted distributed hash tables. The first method, called Linear Method, combines the standard consistent hasing introduced by Karger et al. [9] with a linear weighted distance measure.
Christian Schindelhauer +1 more
openaire +1 more source