Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O(1) time without considering the number of prefixes and its lengths. As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 rout...

We present a novel hetero-associative memory based on dendritic neural computation. The computations in this model are based on lattice group operations. The proposed model does not suffer from the usual storage capacity problem and is extremely robust in the presence of various types of noise and data corruption.

The two-parameter dynamical replica theory (2-DRT) is applied to investigate retrieval properties of non-monotonic associative memory, a model which lacks thermodynamic potential functions. 2DRT reproduces dynamical properties of the model quite well, including the capacity and basin of attraction. Superretrieval state is also discussed in the framework of 2-DRT. The local stability condition o...

We discuss the loading capacity of the neuronic equation for temporal associative memory. We show explicitly how to synthesize a perfect temporal associative memory using a network of such neurons, where all non-linear aspects can be linearized in tensorial space. Keyword: temporal associative memory, neuronic equation, neural network, inverse problem, music perception

Intelligent systems using conventional associative memory model learn the knowledge which is prepared in advance. Therefore they have poor adaptability to the environment different from what the knowledge assumes.In this study, we propose an associative memory model to acquire procedural knowledge sequentially from surroundings of the model.We carried out computer simulations and confirmed that...

In this paper we present an associative-memory-based face detection system. First, the symmetry of human faces is used to quickly locate all the candidates of human faces with all possible sizes and locations. Then two associative memories are used to decide whether or not a human face exits at the locations. Some experimental results are given.

This paper discusses a complex-valued Hopfield associative memory with an iterative incremental learning algorithm. The mathematical proofs derive that the weight matrix is approximated as a weight matrix by the complex-valued pseudo inverse algorithm. Furthermore, the minimum number of iterations for the learning sequence is defined with maintaining the network stability. From the result of si...

We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pattern-completion performance. It is found that the Local Efficiency of the network can be used to predict pattern completion performance for associative memory models built with a range of different connection strateg...

When mixed states are composed of s memory patterns, s types of mixed states, which can become equilibrium states of the model, can be generated. We found that the storage capacity for all mixed states diverged as 1/|f log f | when the s memory patterns were given correlation. We also investigated how the storage capacity of them change on the correlation coefficient between s memory patterns. ...