A graph-theoretic result for a model of neural computation

DOI10.1016/S0166-218X(97)00021-8zbMath0898.05048MaRDI QIDQ1383384

Alexandros V. Gerbessiotis

Publication date: 1 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

strongly regular graphsconnectivityneural computationgraph construction problemprojective plane graphreplication factor

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (3)

A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks ⋮ Random Graphs In A Neural Computation Model ⋮ Experience-Induced Neural Circuits That Achieve High Capacity

Cites Work

• Über ein Problem von K. Zarankiewicz
• A theory of the learnable
• Polarities in finite projective planes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A graph-theoretic result for a model of neural computation