Results 141 to 150 of about 118,403 (212)
Security primitives for memoryless IoT devices based on Physical Unclonable Functions and True Random Number Generators. [PDF]
Sci RepGołofit K.
europepmc +1 more source
General retrieval network model for multi-class plant leaf diseases based on hashing. [PDF]
PeerJ Comput SciYang Z, Wu J, Yuan X, Chen Y, Guo Y.
europepmc +1 more source
ALGORITHM FOR CONSTRUCTING THE ORDERED MINIMAL PERFECT HASHING FUNCTIONS
ALGORITHM FOR CONSTRUCTING THE ORDERED MINIMAL PERFECT HASHING FUNCTIONSopenaire
On the Size of Separating Systems and Families of Perfect Hash Functions
SIAM Journal on Algebraic Discrete Methods, 1984 This paper presents two applications of an interesting information theoretic theorem about graphs. The first application concerns the derivation of good bounds for the function $Y(b,k,n)$, which is defined to be the minimum size of a family of functions such that for every subset of size k from an n element universe, there exists a perfect hash ...
Michael L. Fredman, János Komlós
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Reducing the storage requirements of a perfect hash function
IEEE Transactions on Knowledge and Data Engineering, 1998The amount of memory required by perfect hash functions at retrieval time is one of the primary issues to be taken into account when looking for such functions. This paper gives empirical evidence about the effectiveness of a strategy that is suitable for significantly reducing the memory requirements of the order-preserving minimal perfect hash ...
DI FELICE, Paolino, U. MADAMA
openaire +3 more sources
A perfect hash function for image database indexing
Proceedings of the 1994 ACM symposium on Applied computing - SAC '94, 1994 Chaman L. Sabharwal, Sanjiv Bhatia
semanticscholar +3 more sources
Collections of Functions for Perfect Hashing
SIAM Journal on Computing, 1986 Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Francine Berman +4 more
openalex +3 more sources
Monotone Minimal Perfect Hash Functions
Encyclopedia of Algorithms, 2014Problem Formulation Let Œx denote the set of the first x natural numbers. Given a positive integer u D 2, and a set S Œu with jS j D n, a function h W S ! Œm is perfect if and only if it is injective and minimal if and only if m D n. An (M)PHF is a data structure that allows one to evaluate a (minimal) perfect function of this kind.
P. Boldi, S. Vigna
openaire +3 more sources