Results 11 to 20 of about 168,960 (287)
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 ...
Charalampos Papamanthou +2 more
openaire +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 +2 more sources
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
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
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
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
Distributed Paged Hash Tables [PDF]
, 2003 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
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
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
, 2022 The term scalability with regards to this dissertation has two meanings: It means taking the best possible advantage of the provided resources (both computational and memory resources) and it also means scaling data structures in the literal sense, i.e., growing the capacity, by “rescaling” the table.
openaire +4 more sources