Results 161 to 170 of about 643,283 (231)

Indexing and searching petabase-scale nucleotide resources. [PDF]

Nat Methods
Shiryev SA, Agarwala R.
europepmc   +1 more source

Tracking perishable foods in the supply chain using chain of things technology. [PDF]

Sci Rep
Sathiya V, Nagalakshmi K, Raju K, Lavanya R.   +3 more
europepmc   +1 more source

Trustworthy High-Performance Multiplayer Games with Trust-but-Verify Protocol Sensor Validation. [PDF]

Sensors (Basel)
Joens A, Jillepalli AA, Sheldon FT.
europepmc   +1 more source

A fast implementation of a perfect hash function for picture objects

Pattern Recognition, 1994
Abstract In image database systems, symbolic pictures are represented by two-dimensional (2D) strings that are converted into triples. Each triple is mapped to a unique hash address for timely retrieval of pictures, reducing the pattern-matching problem corresponding to a query to that of computation of a hash function. The values associated with the
Sanjiv Bhatia, Chaman L. Sabharwal
semanticscholar   +4 more sources

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 ...
Michael L. Fredman, János Komlós
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Reducing the Storage Requirements of a Perfect Hash Function

IEEE Transactions on Knowledge and Data Engineering, 1998
The 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.
P. D. Felice, Ugo Madama
semanticscholar   +4 more sources

Monotone Minimal Perfect Hash Functions

Encyclopedia of Algorithms, 2016
Problem 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
semanticscholar   +4 more sources

A perfect hash function for Ada reserved words

ACM SIGAda Ada Letters, 1984
A fast perfect hash function is presented which allows the 63 Adat reserved words to be differentiated quickly from other Ada identifiers. Such functions are potentially useful in improving the performance of software that processes the text of Ada ...
D. Wolverton
semanticscholar   +3 more sources

Minimal and Monotone Minimal Perfect Hash Functions

International Symposium on Mathematical Foundations of Computer Science, 2015
A minimal perfect hash function (MPHF) is a (data structure providing a) bijective map from a set S of n keys to the set of the first n natural numbers. In the static case (i.e., when the set S is known in advance), there is a wide spectrum of solutions available, offering different trade-offs in terms of construction time, access time and size of the ...
P. Boldi
semanticscholar   +3 more sources

Lexicon design using perfect hash functions

ACM SIGSOC Bulletin, 1981
The research reported in this paper derives from the recent algorithm of Cichelli (1980) for computing machine-independent, minimal perfect hash functions of the form:hash value: hash key length + associated value of the key's first letter + associated value of the key's last letterA minimal perfect hash function is one which provides single probe ...
Nick Cercone, Max Krause, John Boates
openalex   +3 more sources