Results 121 to 130 of about 76,072 (189)

A novel framework for secure cryptocurrency transactions using quantum crypto guard. [PDF]

PeerJ Comput Sci
Alsayaydeh JAJ, Yusof MF, Yahaya NA, Kovtun V, Herawan SG.   +4 more
europepmc   +1 more source

Integrating Blockchain Traceability and Deep Learning for Risk Prediction in Grain and Oil Food Safety. [PDF]

Foods
Ge H, Fan K, Zhang Y, Jiang Y, Wang S, Chen Z.   +5 more
europepmc   +1 more source

Integrity verified lightweight ciphering for secure medical image sharing between embedded SoCs. [PDF]

Sci Rep
Janakiraman S, R VR, Sivaraman R, Sridevi A, Upadhyay HN, Amirtharajan R.   +5 more
europepmc   +1 more source

ALGORITHM FOR CONSTRUCTING THE ORDERED MINIMAL PERFECT HASHING FUNCTIONS

ALGORITHM FOR CONSTRUCTING THE ORDERED MINIMAL PERFECT HASHING FUNCTIONS
openaire  

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 ...
Paolo Boldi
semanticscholar   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

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   +3 more sources

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. 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 ...
P. D. Felice, Ugo Madama
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, Mary Ellen Bock, Eric Dittert, Michael J. O’Donnell, Darrell Plank   +4 more
openalex   +3 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 programs.
D. Wolverton
semanticscholar   +2 more sources

Perfect hash functions for large dictionaries

Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience, 2007
We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time.
Amjad M. Daoud
openalex   +2 more sources