Results 101 to 110 of about 1,098,148 (248)
Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice [PDF]
arXiv, 2020 Given a CNF formula F on n variables, the problem of model counting or #SAT is to compute the number of satisfying assignments of F . Model counting is a fundamental but hard problem in computer science with varied applications. Recent years have witnessed a surge of effort towards developing efficient algorithmic techniques that combine the classical ...
arxiv
On the Theory of Spatial and Temporal Locality [PDF]
, 2005 This paper studies the theory of caching and temporal and spatial locality. We show the following results: (1) hashing can be used to guarantee that caches with limited associativity behave as well as fully associative cache; (2) temporal locality cannot
Snir, Marc, Yu, Jing
core
Simple implementation of deletion from open-address hash table [PDF]
arXiv, 2009 Deletion from open-address hash table is not so easy as deletion from chained hash table, because in open-address table we can't simply mark a slot containing deleted key as empty. Search for keys may become incorrect. The classical method to implement deletion is to mark slots in hash table by three values: "free", "busy", "deleted".
arxiv
A Composition Theorem for Universal One-Way Hash Functions [PDF]
, 2000 Victor Shoup
openalex +1 more source
Semi-supervised Hashing for Semi-Paired Cross-View Retrieval [PDF]
arXiv, 2018 Recently, hashing techniques have gained importance in large-scale retrieval tasks because of their retrieval speed. Most of the existing cross-view frameworks assume that data are well paired. However, the fully-paired multiview situation is not universal in real applications.
arxiv
Multi-Dimensional Hash Chains and Application to Micropayment Schemes [PDF]
arXiv, 2005 One-way hash chains have been used in many micropayment schemes due to their simplicity and efficiency. In this paper we introduce the notion of multi-dimensional hash chains, which is a new generalization of traditional one-way hash chains. We show that this construction has storage-computational complexity of O(logN) per chain element, which is ...
arxiv
One-Pass, One-Hash n-Gram Statistics Estimation [PDF]
arXiv, 2006 In multimedia, text or bioinformatics databases, applications query sequences of n consecutive symbols called n-grams. Estimating the number of distinct n-grams is a view-size estimation problem. While view sizes can be estimated by sampling under statistical assumptions, we desire an unassuming algorithm with universally valid accuracy bounds.
arxiv
Linear Probing with Constant Independence [PDF]
arXiv, 2006 Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, previous analysis rely either on complicated and space consuming hash functions, or on the unrealistic ...
arxiv