An Application of ELISA to Perfect Hashing with Deterministic Ordering

3This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a predefined set of keys. The proposed method, which can be used in the ordering phase of a classical Mapping, Deterministic Ordering and Searching (MDOS) approach, is based on a neural network canonical form of efficient gradient descent, for solving linear systems, named ELISA. Numerical experiments clearly show that ELISA is able to determine the optimal solution in many difficult cases, where other alternative algorithms fail or are ineffective.reservedmixedM. BIANCHINI; S. FANELLI; M. GORIBianchini, Monica; S., Fanelli; Gori, Marc

An Application Of Elisa To Perfect Hashing With Deterministic Ordering

This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a predefined set of keys. The proposed method, which can be used in the ordering phase of a classical Mapping, Deterministic Ordering and Searching (MDOS) approach, is based on a neural network canonical form of efficient gradient descent, for solving linear systems, named ELISA. Numerical experiments clearly show that ELISA is able to determine the optimal solution in many difficult cases, where other alternative algorithms fail or are ineffective