1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso

Descripción

A neuron is modeled as a linear threshold gate, and the network architecture considered is the layered feedforward network. It is shown how common arithmetic functions such as multiplication and sorting can be efficiently computed in a shallow neural network. Some known results are improved by showing that the product of two n-bit numbers and sorting of n n-bit numbers can be computed by a polynomial-size neural network using only four and five unit delays, respectively. Moreover, the weights of each threshold element in the neural networks require O(log n)-bit (instead of n -bit) accuracy. These results can be extended to more complicated functions such as multiple products, division, rational functions, and approximation of analytic functions.

Pertenece a

Caltech Authors  

Autor(es)

Siu, Kai -  Yeung -  Bruck, Jehoshua - 

Id.: 55239732

Versión: 1.0

Estado: Final

Tipo:  application/pdf -  image/png - 

Tipo de recurso: Article  -  PeerReviewed  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Formatos:  application/pdf -  image/png - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] http://resolver.caltech.edu/CaltechAUTHORS:20120503-090033553
[References] http://authors.library.caltech.edu/31288/

Fecha de contribución: 27-dic-2012

Contacto:

Localización:
* Siu, Kai-Yeung and Bruck, Jehoshua (1990) Neural computation of arithmetic functions. Proceedings of the IEEE, 78 (10). pp. 1669-1675. ISSN 0018-9219 http://resolver.caltech.edu/CaltechAUTHORS:20120503-090033553

Otros recursos del mismo autor(es)

  1. Atrophin controls developmental signaling pathways via interactions with Trithorax-like
  2. Cyclic Low-Density MDS Array Codes We construct two infinite families of low density MDS array codes which are also cyclic. One of thes...
  3. Shortening Array Codes and the Perfect 1-Factorization Conjecture The existence of a perfect 1-factorization of the complete graph K n, for arbitrary n, is a 40-year ...
  4. Anti-Jamming Schedules for Wireless Data Broadcast Systems Modern society is heavily dependent on wireless networks for providing voice and data communications...
  5. On the Capacity of Precision-Resolution Constrained Systems Arguably, the most famous constrained system is the (d, k)-RLL (run-length limited), in which a stre...

Otros recursos de la mismacolección

  1. Equivalence of Sobolev inequalities and Lieb-Thirring inequalities We show that, under very general definitions of a kinetic energy operator T, the Lieb–Thirring inequ...
  2. Measuring Flux Distributions for Diffusion in the Small-Numbers Limit For the classical diffusion of independent particles, Fick's law gives a well-known relationship bet...
  3. Mechanistic Investigation of β-Galactosidase-Activated MR Contrast Agents We report a mechanistic investigation of an isomeric series of β-galactosidase-activated magnetic re...
  4. Elastic-plastic bending of the lithosphere incorporating rock deformation data, with application to the structure of the Hawaiian archipelago An elastic-plastic lithosphere bending model incorporating rock deformation data has been developed ...
  5. Outstanding hydrogen evolution reaction catalyzed by porous nickel diselenide electrocatalysts To relieve our strong reliance on fossil fuels and to reduce greenhouse effects, there is an ever-gr...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.