On the representation of multi-input systems: Computational properties of 
polynomial algorithms

Poggio, T; Reichardt, W

doi:10.1007/BF00355455

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

On the representation of multi-input systems: Computational properties of polynomial algorithms

MPS-Authors

/persons/resource/persons84913

Poggio, T
Former Department Information Processing in Insects, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

/persons/resource/persons84160

Reichardt, W
Former Department Information Processing in Insects, Max Planck Institute for Biological Cybernetics, Max Planck Society;
Max Planck Institute for Biological Cybernetics, Max Planck Society;

External Resource

https://link.springer.com/content/pdf/10.1007/BF00355455.pdf
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Poggio, T., & Reichardt, W. (1980). On the representation of multi-input systems: Computational properties of polynomial algorithms. Biological Cybernetics, 37(3), 167-186. doi:10.1007/BF00355455.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-F100-9

要旨

This paper introduces a theoretical framework for characterizing and classifying simple parallel algorithms and systems with many inputs, for example an array of photoreceptors. The polynomial representation (Taylor series development) of a large class of operators is introduced and its range of validity discussed. The problems involved in the polynomial approximation of systems are also briefly reviewed. Symmetry properties of the input-output map and their implications for the system structure (i.e. its kernels) are studied. Finally, the computational properties of polynomial mappings are characterized.