Results 51 to 60 of about 3,382,176 (126)

A practical minimal perfect hashing method

, 2005
. We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluation of h(x) requires two memory accesses for any key x and the description
Yoshiharu Kohayakawa, Nivio Ziviani, Fabiano C. Botelho   +2 more
core   +1 more source

Perfect Hashing in FPGA

, 2011
This thesis deals with a design and implementation of a perfect hashing in FPGA by using an FCH method. The method requires 2.6 bits per key to be stored. For the purposes of reference implementation the CMPH library has been used.
Matušová, Lucie
core   +1 more source

Perfect hashing for strings: Formalization and Algorithms

, 1996
Numbers and strings are two objects manipulated by most programs. Hashing has been well-studied for numbers and it has been effective in practice. In contrast, basic hashing issues for strings remain largely unexplored.
Martin Farach, S. Muthukrishnan
core  

Perfect Hashing Schemes for Mining Association Rules

, 2009
[[abstract]]Hashing schemes are widely used to improve the performance of data mining association rules, as in the DHP algorithm that utilizes the hash table in identifying the validity of candidate itemsets according to the number of the table's bucket ...
Chang, C. C.; Lin, C. Y
core  

Theory and practise of monotone minimal perfect hashing

, 2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions have been used to retrieve the position of a key in a given list of keys ...
R. Pagh, D. Belazzougui, S. Vigna, P. Boldi   +3 more
core   +1 more source

On the Cell Probe Complexity of Membership and Perfect Hashing ∗

, 2008
We study two fundamental static data structure problems, membership and perfect hashing, in Yao’s cell probe model. The first space and bit probe optimal worst case upper bound is given for the membership problem.

core  

Application of Minimal Perfect Hashing in Main Memory Indexing

, 1994
With the rapid decrease in the cost of random access memory (RAM), it will soon become economically feasible to place full-text indexes of a library in main memory.
Ho, Yuk
core  

A lightweight hybrid framework for real-time data refinement in resource-constrained underwater and underground wireless sensor networks. [PDF]

Sci Rep
Chelloug SA, Nazir S, Khan R, Khattak MAK, Alturise F, Alkhalaf S.   +5 more
europepmc   +1 more source

A theory of regular Markov perfect equilibria in dynamic stochastic games: genericity, stability, and purification [PDF]

This paper studies generic properties of Markov perfect equilibria in dynamic stochastic games. We show that almost all dynamic stochastic games have a finite number of locally isolated Markov perfect equilibria.
Doraszelski, Ulrich, Escobar, Juan
core  

A cloud server centric multifactor lightweight authentication scheme for eHealth systems. [PDF]

Sci Rep
Gairola D, Maurya PK, Chanda A.
europepmc   +1 more source