LIEPA P 1977 Models of content addressable distributed associative memory. Unpublished manuscript.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....operator that produces noisy but compact representations of associations. Various types of convolution have been used as the associative operators in a number of computational and psychological associative memory models (Willshaw, Buneman, and Longuet Higgins, 1969, Borsellino and Poggio 1973, Liepa 1977, Willshaw 1981, Murdock 1982, Metcalfe 1982, Murdock 1987, Paek and Psaltis 1987, Plate 1994, 1995) Circular convolution is particularly suited to recursive application, and thus the representation of hierarchical structure, because the number of elements in a binding is the same as in the role ....

LIEPA P 1977 Models of content addressable distributed associative memory. Unpublished manuscript.

....remains constant rather than increasing exponentially with the depth of composition as with tensor products. Convolution has been used as the associative operator in a number of computational and psychological memory models [Willshaw, Buneman and Longuet Higgins 1969; Borsellino and Poggio 1973; Liepa 1977; Willshaw 1981; Murdock 1982; Metcalfe Eich 1982; Murdock 1987; Paek and Psaltis 1987] In this Section, I give an overview of HRRs; for more a detailed discussion, see Plate [1995] or Plate [1994] F NaN F NaN F NaN 1 F NaN A F NaN d F NaN v F NaN F NaN n F NaN t F NaN a F NaN g F ....

Liepa, P. 1977. Models of content addressable distributed associative memory. Unpublished manuscript.

.... A number of authors, including Gabor [1968a] Willshaw, Buneman and Longuet Higgins [1969] and Borsellino and Poggio [1973] considered distributed associative memory models based on convolution and correlation (the mathematical operations underlying explanations of holography) More recently, Liepa [1977], Murdock [1982; 1983; 1993] and Metcalfe [1982; 1985; 1991] have used convolution based memories for qualitative and quantitative modelling of human memory performance. Slack [1984b; 1984a; 1986] proposed a convolution based representation for parse trees. Discrete convolution combines two ....

....of different orders have different numbers of elements, lowerorder associations can be padded with zeros. Generally, associations of different orders do not interfere with each other the expected similarity (dot product) of x and x y is zero. Human memory modelling: models and tasks Liepa [1977], Murdock [1982; 1983; 1993] and Metcalfe [1982; 1985; 1991] have proposed various models of human memory for sequences and lists of paired associates, all based 58 on convolution storage methods. I mention the various storage schemes here, but omit many of the details and intricacies of ....

[Article contains additional citation context not shown here]

Liepa, P. 1977. Models of content addressable distributed associative memory. Unpublished manuscript.

....operator that produces noisy but compact representations of associations. Various types of convolution have been used as the associative operators in a number of computational and psychological associative memory models (Willshaw, Buneman, and Longuet Higgins, 1969, Borsellino and Poggio 1973, Liepa 1977, Willshaw 1981, Murdock 1982, Metcalfe 1982, Murdock 1987, Paek and Psaltis 1987) Circular convolution is particularly suited to recursive application, and thus the representation of hierarchical structure, because the number of elements in a binding is the same as in the role and filler. 3.4 ....

Liepa, P. (1977). Models of content addressable distributed associative memory. Unpublished manuscript.

....noise can be introduced by the superposition operation (in the superposition of two patterns half the bits will be random) the scheme has sufficient capacity to be interesting and potentially very useful. A framework for distributed representation schemes 4. 4 CADAM, TODAM, TODAM2 and CHARM Liepa s [1977] CADAM 5 Murdock s TODAM 6 [Murdock 1982] and TODAM2 [Murdock 1993] and Metcalf Eich s CHARM 7 [1982, 1985] use other forms of convolution to bind items in models of human memory. These models use real valued patterns to represent items, and use addition for superposition. CADAM, TODAM and ....

Liepa, P. (1977). Models of content addressable distributed associative memory. Unpublished manuscript.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC