Results 1 to 10 of about 411,225 (25)
Distributing hash families with few rows [PDF]
Theoret. Comput. Sci. 800 (2019), 31-41, 2021 Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend ...
arxiv +1 more source
Revocation management in vehicular ad-hoc networks [PDF]
2015 IEEE Trustcom/BigDataSE/ISPA 1, 1210-1217, 2015, 2022 This paper describes a solution for the efficient management of revocation in vehicular ad-hoc networks, for both certificate-based and identity-based authentication. It proposes the use of an authenticated data structure based on a dynamic hash tree, which is a perfect $k$-ary tree, together with a new version of the SHA-3 hash function.
arxiv
SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing [PDF]
arXiv, 2022 A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set. PHFs can be used for space efficient storage of data in an array, or for determining a compact representative of each object in the set. In this paper, we present the PHF construction algorithm SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.
arxiv
Bounds for c-Ideal Hashing [PDF]
arXiv, 2023 In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality. On the one hand, this notion generalizes the definition of perfect hashing, which has been studied extensively; on the other hand, it provides a direct link to the ...
arxiv
A Genetic Algorithm for Obtaining Memory Constrained Near-Perfect Hashing [PDF]
, 2020 The problem of fast items retrieval from a fixed collection is often encountered in most computer science areas, from operating system components to databases and user interfaces. We present an approach based on hash tables that focuses on both minimizing the number of comparisons performed during the search and minimizing the total collection size ...
arxiv +1 more source
Binarized octree generation for Cartesian adaptive mesh refinement around immersed geometries [PDF]
, 2017 We revisit the generation of balanced octrees for adaptive mesh refinement (AMR) of Cartesian domains with immersed complex geometries. In a recent short note [Hasbestan and Senocak, J. Comput. Phys. vol. 351:473-477 (2017)], we showed that the data-locality of the Z-order curve in hashed linear octree generation methods may not be perfect because of ...
arxiv +1 more source
Secret sharing scheme based on hashing [PDF]
arXiv, 2023 We propose an adaptive threshold multi secret sharing scheme based solely on cryptographically secure hash functions. We show that the proposed scheme is also: perfect, ideal, verifiable, and proactive. Moreover the proposed scheme has a low computational complexity comparing to the most common schemes operating over finite fields.
arxiv
Deep Cross-modal Hashing via Margin-dynamic-softmax Loss [PDF]
arXiv, 2020 Due to their high retrieval efficiency and low storage cost for cross-modal search task, cross-modal hashing methods have attracted considerable attention. For the supervised cross-modal hashing methods, how to make the learned hash codes preserve semantic information sufficiently contained in the label of datapoints is the key to further enhance the ...
arxiv
De Dictionariis Dynamicis Pauco Spatio Utentibus [PDF]
arXiv, 2005 We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up to constant factors, subject to insertions and deletions, and subject to supporting perfect-hashing queries and/or membership queries, each operation in constant time with high probability. When supporting only membership queries, we attain the optimal space bound
arxiv
Memory-efficient and Ultra-fast Network Lookup and Forwarding using Othello Hashing [PDF]
arXiv, 2016 Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm to support fast lookups. In this paper, we present a new network algorithm, Othello Hashing, and its application of a FIB design called ...
arxiv