Research Catalog

Discrete neural computation : a theoretical foundation

Title
Discrete neural computation : a theoretical foundation / Kai-Yeung Siu, Vwani Roychowdhury, and Thomas Kailath.
Author
Siu, Kai-Yeung, 1966-
Publication
  • Englewood Cliffs, N.J. : Prentice Hall PTR, [1995]
  • ©1995.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
Not available - Please for assistance.
TextUse in library QA76.87 .S538 1995Off-site

Details

Additional Authors
  • Roychowdhury, Vwani P.
  • Kailath, Thomas.
Description
xxiv, 407 pages : illustrations; 25 cm
Summary
Interest in artificial neural networks has sparked research efforts in many disciplines, including neurobiology, physics, mathematics, computer science, and engineering. To help readers keep pace, this book brings together recent developments in discrete neural computation. Discussion encompass basic models for discrete neural computation, fundamental concepts in computational complexity, designs of threshold circuits for computing various functions, techniques for analyzing the computational power of neural models. This book presents an integrated approach to promoting a better understanding of the foundations of neural computation, while stimulating further development.
Series Statement
Prentice Hall information and system sciences series
Uniform Title
Prentice-Hall information and system sciences series.
Alternative Title
Theoretical foundation
Subject
  • Neural networks (Computer science)
  • Programming (Mathematics)
  • Self-organizing systems
  • Neural computers
  • Artificial intelligence
  • Neural Networks, Computer
  • Artificial Intelligence
  • artificial intelligence
  • Neuronales Netz
  • Inteligencia artificial
Genre/Form
  • Instructional and educational works.
  • Matériel d'éducation et de formation.
Bibliography (note)
  • Includes bibliographical references (p. 389-399) and index.
Contents
Foreword / Marvin Minsky -- Introduction -- Linear threshold element -- Computing symmetric functions -- Depth-efficient arithmetic circuits -- Depth/size trade-offs -- Computing with small weights -- Rational approximation and optimal-size circuits -- Geometric framework and spectral analysis -- Limitations of AND-OR circuits -- Lower bounds via communication complexity -- Hopfield network.
ISBN
  • 0133007081
  • 9780133007084
LCCN
95159023
OCLC
  • ocm32180885
  • 32180885
  • SCSB-2052232
Owning Institutions
Princeton University Library