In this paper an exact and general formula is derived for the number of linear partitions of a given subset V /spl sub/ R/sup 3/, depending on the configuration formed by the points of V. V can be a multi-set, that is it may contain points that coincide. Using the formula, we obtain a fast algorithm for computing the capacity of three-input k-valued one-threshold perceptrons.
展开▼
机译:本文针对给定子集V / spl sub / R / sup 3 /的线性分区数推导了精确的通用公式,具体取决于V点形成的配置。V可以是多集,也就是说它可能包含重合的点。使用该公式,我们获得了一种用于计算三输入k值一阈值感知器的容量的快速算法。
展开▼