Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR01-071 | 24th October 2001 00:00

Neural Circuits for Pattern Recognition with Small Total Wire Length

RSS-Feed




TR01-071
Authors: Robert Albin Legenstein
Publication: 24th October 2001 11:27
Downloads: 1097
Keywords: 


Abstract:

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.



ISSN 1433-8092 | Imprint