Results 71 to 80 of about 398 (99)

A dictionary implementation based on dynamic perfect hashing

ACM Journal of Experimental Algorithmics, 2008
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic perfect hashing” as described by Dietzfelbinger et al. ( SIAM J. Computing 23 , 1994, pp. 738--761), an extension of the storage scheme proposed by Fredman et al. ( J. ACM
Christoph Weidling, Martin Hühne, Martin Dietzfelbinger   +2 more
openaire   +3 more sources

Dynamic Perfect Hashing with Finite-State Automata

, 2006
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Addition of new words would change the order of words already in the language of the automaton, changing the ...
Denis Maurel, Jan Daciuk, Agata Savary
openaire   +3 more sources

Perfect Hashing for Method Dispatch with Dynamic Typing and Dynamic Compilation

, 2012
In static typing, the receiver's static type is the key to efficient implementation of method invocation, and a recently proposed technique, based on perfect hashing of classes, cannot apply to dynamic typing because of the lack of static types. In this article, we propose a new application of perfect hashing to method dispatch in a dynamic typing ...
Roland Ducournau
openaire   +2 more sources

Filter Based Data Deduplication in Cloud Storage Using Dynamic Perfect Hash Functions

International journal of simulation: systems, science & technology, 2018
M. Rao, B. Reddy
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A dynamic perfect hashing algorithm using prime numbers

Summary: The use of a mathematical function to map a range of key values into a smaller range of relative addresses is known as hashing. A perfect hashing algorithm maps key values into relative addresses on a one-to-one basis. An efficient hashing algorithm must minimize the number of unoccupied storage positions. This paper presents an algorithm that
Olagunju, Amos, Gourdine, Rashaunda
openaire   +1 more source

A Minimalist Single‐Layer Metasurface for Arbitrary and Full Control of Vector Vortex Beams

Advanced Materials, 2020
Yanjun Bao, Jincheng Ni, Cheng Wei Qiu
exaly  

Extendible RDMA-Based Remote Memory KV Store with Dynamic Perfect Hashing Index

Zirui Liu, X. Y. Niu, Wei Zhou, Yisen Hong, Zhaoyao Shi, Tong Yang, Yuchao Zhang, Yuhan Wu, Yikai Zhao, Zhuochen Fan, Bin Cui   +10 more
openalex   +1 more source

Multichannel Superposition of Grafted Perfect Vortex Beams

Advanced Materials, 2022
Hammad Ahmed, Yuttana Intaravanne, Muhammad Afnan Ansari   +2 more
exaly  

A perfect storm: How tumor biology, genomics, and health care delivery patterns collide to create a racial survival disparity in breast cancer and proposed interventions for change

Ca-A Cancer Journal for Clinicians, 2015
Bobby Daly, Olufunmilayo I Olopade
exaly  

Coherent perfect absorbers: linear control of light with light

Nature Reviews Materials, 2017
Denis G Baranov, Alex Krasnok, Timur O Shegai   +2 more
exaly