Results 31 to 40 of about 1,628,666 (344)
MIHash: Online Hashing with Mutual Information [PDF]
, 2017 Learning-based hashing methods are widely used for nearest neighbor retrieval, and recently, online hashing methods have demonstrated good performance-complexity trade-offs by learning hash functions from streaming data. In this paper, we first address a
Bargal, Sarah Adel +3 more
core +1 more source
Hash Indexing-Based Image Matching for 3D Reconstruction
Applied Sciences, 2023 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]
ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, 2023 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
Dianzi Jishu Yingyong, 2020 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
On Routing in Distributed Hash Tables [PDF]
Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007), 2007 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
A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression
IEEE Access, 2020 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
Comparison of Hash Table Performance with Open Addressing and Closed Addressing: An Empirical Study [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2015 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
Locality-Sensitive Hashing for Information Retrieval System on Multiple GPGPU Devices
Applied Sciences, 2020 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
Time-Memory Analysis of Parallel Collision Search Algorithms
Transactions on Cryptographic Hardware and Embedded Systems, 2021 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
PaCHash: Packed and Compressed Hash Tables
, 2023 We introduce PaCHash, a hash table that stores its objects contiguously in an array without intervening space, even if the objects have variable size. In particular, each object can be compressed using standard compression techniques. A small search data structure allows locating the objects in constant expected time.
Kurpicz, Florian +2 more
openaire +4 more sources