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 evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...
In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. ...
Digital watermarking is a growing research area to mark digital content by embedding information into the content itself. Perceptual hashing is used to identify a specific content...
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...