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, ...
详细信息
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.","doi":"10.1109/TPAMI.1985.4767688","publicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","startPage":"490","endPage":"498","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=Reliability+and+Speed+of+Recall+in+an+Associative+Network&isbn=&publicationDate=July+1985&author=Anders+Lansner&ContentID=10.1109/TPAMI.1985.4767688&orderBeanReset=true&startPage=490&endPage=498&volumeNum=PAMI-7&issueNum=4","displayPublicationTitle":"IEEE Transactions on Pattern analysis and Machine Intelligence","pdfPath":"/iel5/34/4767672/***","keywords":[{"type":"IEEE Keywords","kwd":["Power system reliability","Pattern recognition","Neuroscience","Associative memory","Estimation theory","Information retrieval","Parallel processing","Telecommunication network reliability","Biological neural networks","Computer science"]},{"type":"Author Keywords ","kwd":["storage capacity","Associative network","pattern completion","pattern recognition","reliability of recall"]}],"allowComments":false,"pubLink":"/xpl/***?punumber=34","issueLink":"/xpl/***?isnumber=4767672","standardTitle":"Reliability and Speed of Recall in an Associative Network
We show that unification in the equational theory defined by the one-sided distributivity law x × (y+z)=x×y+x×z is decidable and that unification is undecidable if the laws of associativity x+(y+z)=(x+y...
详细信息
作者：
Riesel, HansRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
Progress in factorization of large integers since the introduction of computers is reported. Thanks to theoretical advances and refinements, as well as to more powerful computers, the practical limit of integers possi...
详细信息
Progress in factorization of large integers since the introduction of computers is reported. Thanks to theoretical advances and refinements, as well as to more powerful computers, the practical limit of integers possible to factor has been raised considerably during the past 20 years. The present practical limit is around 10**7**5 if supercomputers are used and if much computer time is available.
作者：
Arnborg, StefanRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
A survey is presented of recent developments in methods for solving combinatorially difficult, i. e. , NP-hard, problems defined on simple, labelled or unlabelled, graphs or hypergraphs. The author first gives graph-t...
详细信息
A survey is presented of recent developments in methods for solving combinatorially difficult, i. e. , NP-hard, problems defined on simple, labelled or unlabelled, graphs or hypergraphs. The author first gives graph-theoretic definitions and some basic properties of graphs related to elimination processes, required for a comprehensive treatment of table-based reduction algorithms. He then explains the table-based reduction method and exemplifies it with algorithms for some independent set problems. The problem of finding suitable elimination orderings, either with rewrite rule techniques or with dynamic programming methods, as well as the complexity of the optimization of elimination ordering, is treated next. The basic method gives efficient algorithms for graphs which can be decomposed by a set of small separators. Graphs without small separators can still be treated for certain problems when they are clique decomposable. Results for such graphs are reviewed, as well as a new decomposition method, applicable to graphs with bounded complement decomposability.
作者：
Sundblad, YngveRoyal Inst of Technology
Dep of Numerical Analysis & Computing Science Stockholm Swed Royal Inst of Technology Dep of Numerical Analysis & Computing Science Stockholm Swed
Limitations in resolution of bilevel display screens and processing power of processors call for special considerations in the design of computerized tools for make-up of document and newspaper pages. Here we discuss ...
详细信息
ISBN:
(纸本)0444876170
Limitations in resolution of bilevel display screens and processing power of processors call for special considerations in the design of computerized tools for make-up of document and newspaper pages. Here we discuss and illustrate various such considerations for presentation of text with typography, graphics and continuous tone images.
The Durand-Kerner method is an iterative method for the simultaneous determination of all zeros of a polynomial. We derive a property of the iterates of this method, which gives one reason for its good behaviour. We a...
The Durand-Kerner method is an iterative method for the simultaneous determination of all zeros of a polynomial. We derive a property of the iterates of this method, which gives one reason for its good behaviour. We also exhibit an example supporting the experience that the serial mode of the method will converge faster than the parallel mode also for multiple zeros.
The problem of segmenting aerial photographs can generally not be solved in a reasonable manner by use of the information in the image alone. In this paper we present a structured approach to the problem, which in add...
详细信息
The problem of choosing tickmarks for nonlinear scales is of interest for some kindsof diagrams, e.g., nomograms and contour plots. A method for getting “nice”values at the tickmarks is discussed based on a database...
Die Lösungen des Coulombschen Reibungsproblems für starre Körper in zwei Dimensionen werden analysiert. Das bestimmende System von gewöhnlichen Differentialgleichungen und Ungleichungen wird aufges...
Die Lösungen des Coulombschen Reibungsproblems für starre Körper in zwei Dimensionen werden analysiert. Das bestimmende System von gewöhnlichen Differentialgleichungen und Ungleichungen wird aufgestellt. Beispiele werden vorgelegt, die einige ungewünschte Eigenschaften dieses speziellen Reibungsgesetzes nachweisen. Hinreichende Bedingungen für Existenz und Eindeutigkeit werden mit Hilfe der Theorie der linearen Komplementarität hergeleitet. The solutions to the Coulomb friction problem for rigid bodies in two dimensions are analyzed. The governing system of ordinary differential equations and inequalities is derived. Examples are presented demonstrating undesirable properties of this particular law of friction. Sufficient conditions for existence and uniqueness are given using the theory of linear complementarity.
A design process for a query language based on set algebra is described. Key principles used in the design are: make explicit assumptions about the end users background, delimit the scope of the language, and make it ...
A design process for a query language based on set algebra is described. Key principles used in the design are: make explicit assumptions about the end users background, delimit the scope of the language, and make it simple by omitting all features that have not been found necessary. The language closely mirrors concepts well known from algebra and set theory: it contains no join or relational division, and it has a high expressive power.
暂无评论