Uchizawa K, Douglas R, Maass W. (2006). On the computational power of threshold circuits with sparse activity. Neural computation. 18 [PubMed]

See more from authors: Uchizawa K · Douglas R · Maass W

References and models cited by this paper

Cheremisin OV. (2003). On the activity of cell circuits realising the system of all conjunctions Discrete Math Appl. 13

Groger HD, Turan G. (1991). On linear decision trees computing Boolean functions Lecture Notes In Computer Science. 510

Kailath T, Siu KY, Roychowdhury V. (1995). Discrete neural computation; A theoretical foundation.

Kasim-Zade M. (1992). On a measure of the activeness of circuits made of functional elements Math Prob Cybernet. 4

Kissin G. (1991). Upper and lower bounds on switching energy in VLSI J Assoc Comp Mach. 38

Lennie P. (2003). The cost of cortical computation. Current biology : CB. 13 [PubMed]

Maass W, Turan G, Hajnal A, Pudlak P, Szegedy M. (1993). Threshold circuits of bounded depth J Comput System Sci. 46

Margrie TW, Brecht M, Sakmann B. (2002). In vivo, low-resistance, whole-cell recordings from neurons in the anaesthetized and awake mammalian brain. Pflugers Archiv : European journal of physiology. 444 [PubMed]

Minsky M, Papert S. (1969). Perceptrons: An Introduction to Computational Geometry.

Olshausen BA, Anderson CH, Van Essen DC. (1995). A multiscale dynamic routing circuit for forming size- and position-invariant object representations. Journal of computational neuroscience. 2 [PubMed]

Orlitsky A, Roychowdhury VP, Siu KY. (1994). Theoretical advances in neural computation and learning.

Parberry I. (1994). Circuit complexity and neural networks.

Reif JH, Tyagi A. (1990). Energy complexity of optical computations Proc 2nd IEEE Symposium on Parallel and Distributed Processing.

Weinzweig MN. (1961). On the power of networks of functional elements Dokl Akad Nauk SSSR. 139

References and models that cite this paper
This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.