THE CAPACITY OF THE KANERVA ASSOCIATIVE MEMORY

被引：30

作者：

CHOU, PA ^{[1
]}

机构：

[1] STANFORD UNIV, DEPT ELECT ENGN, INFORMAT SYST LAB, STANFORD, CA 94305 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1989年 / 35卷 / 02期

关键词：

D O I：

10.1109/18.32123

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：281 / 298

页数：18

共 28 条

[1] INFORMATION CAPACITY OF THE HOPFIELD MODEL [J].

ABUMOSTAFA, YS ;

ST JACQUES, JM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (04) :461-464

[2]

ALBUS JS, 1981, BRAINS BEHAVIOR ROBO

[3] LEARNING PATTERNS AND PATTERN SEQUENCES BY SELF-ORGANIZING NETS OF THRESHOLD ELEMENTS [J].

AMARI, SI .

IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (11) :1197-+

[4] STORING INFINITE NUMBERS OF PATTERNS IN A SPIN-GLASS MODEL OF NEURAL NETWORKS [J].

AMIT, DJ ;

GUTFREUND, H ;

SOMPOLINSKY, H .

PHYSICAL REVIEW LETTERS, 1985, 55 (14) :1530-1533

[5]

ANDERSON J A, 1972, Mathematical Biosciences, V14, P197, DOI 10.1016/0025-5564(72)90075-2

[6]

BAUM EB, 1988, UNPUB BIOL CYBERN

[7]

CHOU PA, 1988, NEURAL INFORMATION P, P184

[8] A NONCONSTRUCTIVE UPPER BOUND ON COVERING RADIUS [J].

COHEN, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :352-353

[9] CONNECTIONIST ARCHITECTURES FOR ARTIFICIAL-INTELLIGENCE [J].

FAHLMAN, SE ;

HINTON, GE .

COMPUTER, 1987, 20 (01) :100-109

[10]

FLYNN MJ, 1988, UNPUB IEEE COMPUT MA

← 1 2 3 →