The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1985 vol.7)
pp: 490-498
Anders Lansner , Department of Numerical Analysis and Computing Science, the Royal Institute of Technology, S-100 44, Stockholm, Sweden.
Orjan Ekeberg , Department of Numerical Analysis and Computing Science, the Royal Institute of Technology, S-100 44, Stockholm, Sweden.
ABSTRACT
Previous investigations of the storage capacity of associative nets have not explicitly considered quantitative aspects of the tradeoff between storage capacity and reconstructive power in these systems. Furthermore, few comparisons have been made between theoretical estimates and experimental results (simulations). In this correspondence, we describe some results recently obtained and relevant to these issues. It is shown that a high storage capacity is possible, without sacrificing reliability in the recall process. Furthermore, an efficient algorithm for retrieval of the information stored is presented, and the speed of recall employing various degrees of parallelism is discussed.
CITATION
Anders Lansner, Orjan Ekeberg, "Reliability and Speed of Recall in an Associative Network", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.7, no. 4, pp. 490-498, April 1985, doi:10.1109/TPAMI.1985.4767688
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool