Results 151 to 160 of about 76,072 (189)

Implementation of a Perfect Hash Function Scheme [PDF]

open access: possible, 2013
This report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm proposed by Thomas Sager. An implementation of that algorithm in C has been done to demonstrate and verify the behavior of the algorithm for various settings of parameters.
Datta, Sanjeev, Fox, Edward A.
openaire  

Design Strategies for Minimal Perfect Hash Functions

2007
A minimal perfect hash function h for a set S ⊆ U of size n is a function h:U → {0,. . ., n-1} that is one-to-one on S. The complexity measures of interest are storage space for h, evaluation time (which should be constant), and construction time. The talk gives an overview of several recent randomized constructions of minimal perfect hash functions ...
openaire   +1 more source

A scheme for constructing ordered minimal perfect hashing functions

Information Sciences, 1986
This paper describes a method to be used for the organization and retrieval of data. Jaeschke proposed the function \(h(k)=\lfloor C/(Dk+E)\rfloor mod n\), where n is the size of a given key set, for constructing minimal perfect hashing functions.
openaire   +1 more source

Fundamentals and developments in fluorescence-guided cancer surgery

Nature Reviews Clinical Oncology, 2021
Friso Achterberg   +2 more
exaly  

A chaos-based keyed hash function based on fixed point representation

Cluster Computing, 2018
J. Teh, K. Tan, Moatsum Alawida
semanticscholar   +1 more source

A guide to comprehensive phosphor discovery for solid-state lighting

Nature Reviews Materials, 2023
Shruti Hariyani   +2 more
exaly  

Home - About - Disclaimer - Privacy