๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast implementation of a perfect hash function for picture objects

โœ Scribed by Sanjiv K. Bhatia; Chaman L. Sabharwal

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
923 KB
Volume
27
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A perfect Hashing function for exact dia
A perfect Hashing function for exact diagonalization of many-body systems of identical particles
โœ Shoudan Liang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 355 KB

In exact diagonalization studies of ground state properties of an interacting system using Lfinczos, it is crucial to find an efficient mapping from the configuration space to the index of the L~inczos vector. Here, we formulate a mapping (hashing |unction) that is simple to calculate for identical

Tiny families of functions with random p
Tiny families of functions with random properties: A quality-size trade-off for hashing
โœ Oded Goldreich; Avi Wigderson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 298 KB ๐Ÿ‘ 2 views

We present three explicit constructions of hash functions, which exhibit a ลฝ trade-off between the size of the family and hence the number of random bits needed to . ลฝ . generate a member of the family , and the quality or error parameter of the pseudorandom property it achieves. Unlike previous con

A method of generating objective functio
A method of generating objective functions for probability estimation
โœ Jayadev Billa; Amro El-Jaroudi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

Multi-Layer Neural Networks (MLNNs) have been known to be used to model the statistical properties of their training data. Several authors have shown that, depending on the objective function chosen, MLNNs estimate the posterior class probabilities of their inputs, provided the network is trained w