16 search results - page 2 / 4 » A Practical Minimal Perfect Hashing Method |
ICGA
2008
13 years 7 months ago
2008
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
LREC
2010
13 years 9 months ago
2010
The recent availability of large collections of text such as the Google 1T 5-gram corpus (Brants and Franz, 2006) and the Gigaword corpus of newswire (Graff, 2003) have made it po...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature ...
ICONIP
1998
13 years 8 months ago
1998
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...