Results 11 to 20 of about 23,863 (307)
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
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
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
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
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 ...
Charalampos Papamanthou +2 more
openaire +1 more source
A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression
LZ77 is a dictionary compression algorithm by replacing the repeating sequence with the addresses of the previous referenced data in the stream. To find out these repetition, the LZ77 encoder maintains a hashing table, which have to frequently calculate ...
Hao Jiang, Sian-Jheng Lin
doaj +1 more source
Locality-Sensitive Hashing for Information Retrieval System on Multiple GPGPU Devices
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
Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study [PDF]
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
Time-Memory Analysis of Parallel Collision Search Algorithms
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
Distributed Paged Hash Tables [PDF]
In this paper we present the design and implementation of DPH, a storage layer for cluster environments. DPH is a Distributed Data Structure (DDS) based on the distribution of a paged hash table. It combines main memory with file system resources across the cluster in order to implement a distributed dictionary that can be used for the storage of very ...
Rufino, José +3 more
openaire +2 more sources

