Analog VLSI and neural systems
Analog VLSI and neural systems
Winner-take-all networks of O(N) complexity
Advances in neural information processing systems 1
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
On the Computational Power of Winner-Take-All
Neural Computation
Analog versus discrete neural networks
Neural Computation
Wire length as a circuit complexity measure
Journal of Computer and System Sciences
| Hi-index | 0.00 |
One of the most basic pattern recognition problems is whether a certain local feature occurs in some linear array to the left of some other local feature. We construct in this article circuits that solve this problem with an asymptotically optimal number of threshold gates. Furthermore it is shown that much fewer threshold gates are needed if one employs in addition a small number of winner-take-all gates. In either case the circuits that are constructed have linear or almost linear total wire length, and are therefore not unrealistic from the point of view of physical implementations.