Results 21 to 30 of about 1,628,666 (344)
Mathematics, 2023 Chaotic systems, especially hyper-chaotic systems are suitable for digital image encryption because of their complex properties such as pseudo randomness and extreme sensitivity. This paper proposes a new color image encryption algorithm based on a hyper-
Xiaoyuan Wang +5 more
semanticscholar +1 more source
Hash Tables for a Digital Lexicon [PDF]
Revista de Informática Teórica e Aplicada, 2021 This paper deals with the construction of digital lexicons within the scope of Natural Language Processing. Data Structures called Hash Tables have demonstrated to generate good results for Natural Language Interface for Databases and have data dispersion, response speed and programming simplicity as main features.
Fábio Carlos Moreno +2 more
openaire +2 more sources
Authenticated hash tables [PDF]
Proceedings of the 15th ACM conference on Computer and communications security, 2008 Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so that the client can save space or achieve load balancing. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ...
Nikos Triandopoulos +2 more
openaire +2 more sources
Key Concepts, Weakness and Benchmark on Hash Table Data Structures
Algorithms, 2022 Most computer programs or applications need fast data structures. The performance of a data structure is necessarily influenced by the complexity of its common operations; thus, any data-structure that exhibits a theoretical complexity of amortized ...
Santiago Tapia-Fernández +2 more
doaj +1 more source
The Computer Journal, 1974 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)
Ole Amble, Donald E. Knuth
openaire +1 more source
IEEE Access, 2020 With the development of the Internet, numerous new applications have emerged, the features of which are constantly changing. It is necessary to perform application classification detection on the network traffic to monitor the changes in the applications.
Shichang Xuan +5 more
doaj +1 more source
FAST IMPLEMENTATION OF DIGITAL WATERMARKING SCHEMES BASED ON ARNOLD AND DISCRETE WAVELET TRANSFORMS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2021 In recent years, digital watermarking of photo and video materials has become more and more important in connection with the transmission of multimedia data over unsecured communication channels.
A. G. Zotin, A. V. Proskurin
doaj +1 more source
Design and Application of Deep Hash Embedding Algorithm with Fusion Entity Attribute Information
Entropy, 2023 Hash is one of the most widely used methods for computing efficiency and storage efficiency. With the development of deep learning, the deep hash method shows more advantages than traditional methods. This paper proposes a method to convert entities with
Xiaoli Huang, Haibo Chen, Zheng Zhang
doaj +1 more source
Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host [PDF]
, 2010 Resources in a distributed system can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in
Chung, Yoo
core +1 more source
ACM Transactions on Parallel Computing, 2016 Concurrent hash tables are one of the most important concurrent data structures, which are used in numerous applications. For some applications, it is common that hash table accesses dominate the execution time. To efficiently solve these problems in parallel, we need implementations that achieve speedups in highly concurrent scenarios.
Maier, T., Sanders, P., Dementiev, R.
openaire +6 more sources