Results 21 to 30 of about 1,756,456 (179)
Key Concepts, Weakness and Benchmark on Hash Table Data Structures
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
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
Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host [PDF]
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
FASTHash: FPGA-Based High Throughput Parallel Hash Table
Hash table is a fundamental data structure that provides efficient data store and access. It is a key component in AI applications which rely on building a model of the environment using observations and performing lookups on the model for newer ...
Yang Yang+4 more
semanticscholar +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
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
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