Key points are not available for this paper at this time.
For the class of linearly separable two class (boolean) functions the Perceptron with maximal stability defines in the space of all possible input configurations the direction along which the distance between the two classes is minimal. This solution has several advantages: it is unique, it is robust, and has the best generalization probability among all known linear discriminants. I present here an active set approach to the dual problem, finding the minimal connector between two disjoint convex hulls. If N is the number of the input units and M is the number of examples, this algorithm runs in O (MN 2) steps and requires the storage of a symmetric (N + 3) \ (N + 3) matrix. 1 Introduction R. Rammal was a physicist with many faces. He was interested in problems, which he solved with whatever methods he found useful, analytical or numerical. For example, he was not afraid to learn from computer scientists how to compute effectively the ground state of two dimensional spin glas. . .
P. Ruján (Mon,) studied this question.