Results 21 to 30 of about 1,500,333 (340)
Authenticated hash tables [PDF]
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
Data Integrity is one of the primary concepts in information security. The main task of the cryptographic hash function is to assure the integrity of the transmitted data.
Mishal Almazrooie+5 more
doaj +1 more source
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]
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
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
Hash Indexing-Based Image Matching for 3D Reconstruction
Image matching is a basic task in three-dimensional reconstruction, which, in recent years, has attracted extensive attention in academic and industrial circles.
Mingwei Cao, Haiyan Jiang, Haifeng Zhao
doaj +1 more source
Compact Neural Graphics Primitives with Learned Hash Probing [PDF]
Neural graphics primitives are faster and achieve higher quality when their neural networks are augmented by spatial data structures that hold trainable features arranged in a grid.
Towaki Takikawa+6 more
semanticscholar +1 more source
Fast topology algorithm for STL files based on half-edges structure
In order to solve the problem that the topological relationship between the triangular facets is lost when the 3D model is converted to STL files,in the process of reading and analyzing STL files, a fast topology reconstruction algorithm based on half ...
Wu Xiaochao, Chen Hong
doaj +1 more source
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
On Routing in Distributed Hash Tables [PDF]
There have been many proposals for constructing routing tables for distributed hash tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allow order-preserving hash functions that lead to a skewed peer distribution in the identifier space.
F. Klemm+3 more
openaire +2 more sources