Results 171 to 180 of about 647,966 (230)

Simple and Space-Efficient Minimal Perfect Hash Functions [PDF]

, 2007
A perfect hash function (PHF) h : U → [0,m - 1] for a key set S is a function that maps the keys of S to unique values. The minimum amount of space to represent a PHF for a given set S is known to be approximately 1.44n2/m bits, where n = |S|. In this paper we present new algorithms for construction and evaluation of PHFs of a given set (for m = n and ...
Fabiano C. Botelho, Rasmus Pagh, Nívio Ziviani   +2 more
openalex   +2 more sources

A faster algorithm for constructing minimal perfect hash functions

Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92, 1992
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is very close to the theoretical lower bound, i.e., around 2
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath   +2 more
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

A perfect hash function for image database indexing

Proceedings of the 1994 ACM symposium on Applied computing - SAC '94, 1994
C. Sabharwal, S. Bhatia
semanticscholar   +3 more sources

Perfect Hash-Based Routing Lookup for LEO Constellation Backbone Network

IEEE Transactions on Aerospace and Electronic Systems, 2023
The performance of packet forwarding mainly relies on the routing lookup (RL) in high-speed routers and switches. Due to the network topology change and the limited resource on aerospace devices, the RL strategy for low Earth orbiting (LEO) constellation
Keran Zhang, Lei Tang, Sheng Zhong, Hangzai Luo, Chao Zhao   +4 more
semanticscholar   +1 more source

Secret-Key Exchange Through Synchronization of Randomized Chaotic Oscillators Aided by Logistic Hash Function

IEEE Transactions on Circuits and Systems Part 1: Regular Papers, 2022
We have developed a method of secret-key exchange assisted by a secure hash algorithm for a stream cipher based on the augmented Lorenz map as a high-dimensional chaotic map.
Koshiro Onuki, K. Cho, Y. Horio, T. Miyano   +3 more
semanticscholar   +1 more source

Collections of Functions for Perfect Hashing

SIAM Journal on Computing, 1986
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. Such a technique has been called “perfect hashing”
Francine Berman, Mary Ellen Bock, Eric Dittert, Michael J. O’Donnell, Darrell Plank   +4 more
openaire   +2 more sources

SAPFS: An Efficient Symmetric-Key Authentication Key Agreement Scheme With Perfect Forward Secrecy for Industrial Internet of Things

IEEE Internet of Things Journal, 2023
An edge-cloud Industrial Internet of Things (IIoT) can help meet the computing requirements of industrial applications, particularly in time and latency-sensitive services.
Yunru Zhang, De-biao He, P. Vijayakumar, Min Luo, Xinyi Huang   +4 more
semanticscholar   +1 more source

Fast kmer counting table algorithm using perfect hash function: C++ pseudo-code integration into R using Rcpp API

, 2016
Counting kmers (substrings of length k in DNA sequence data) is an essential component of many methods in bioinformatics, including data preprocessing for de novo assembly, repeat detection, and sequencing coverage estimation.
M. E. Macherki
semanticscholar   +1 more source

Fingerprinting-based Minimal Perfect Hashing Revisited

ACM Journal of Experimental Algorithmics, 2023
In this paper we study a fingerprint-based minimal perfect hash function (FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages ...
Piotr Beling
semanticscholar   +1 more source

Perfect hashing functions for hardware applications

[1991] Proceedings. Seventh International Conference on Data Engineering, 2002
Perfect hashing functions are determined that are suitable for hardware implementations. A trial-and-error method of finding perfect hashing functions is proposed using a simple universal/sub 2/ class (H/sub 3/) of hashing functions. The results show that the relative frequency of perfect hashing functions within the class H/sub 3/ is the same as ...
G.A. Portice, M.V. Ramakrishna
openaire   +2 more sources