scientific article
From MaRDI portal
Publication:3992681
zbMath0685.68009MaRDI QIDQ3992681
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artificial intelligence (68T99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20)
Related Items (max. 100)
Efficient retrieval from sparse associative memory ⋮ A quantitative theory of neural computation ⋮ A possible neural representation of mathematical group structures ⋮ Efficient and robust associative memory from a generalized Bloom filter ⋮ Representing Objects, Relations, and Sequences ⋮ Iterative Retrieval and Block Coding in Autoassociative and Heteroassociative Memory ⋮ Efficient Associative Computation with Discrete Synapses ⋮ Continuous Online Sequence Learning with an Unsupervised Neural Network Model ⋮ Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities ⋮ Integer sparse distributed memory: analysis and results ⋮ Optimising synaptic learning rules in linear associative memories ⋮ Circuit Polarity Effect of Cortical Connectivity, Activity, and Memory ⋮ Neural Associative Memory with Optimal Bayesian Learning ⋮ The future of (mathematical) music theory ⋮ Sparse distributed memory using \(N\)-of-\(M\) codes ⋮ Memory Capacities for Synaptic and Structural Plasticity ⋮ Sparse distributed fuzzy inference systems ⋮ Resolution of binary coding of real-valued vectors by hyperrectangular receiptive fields ⋮ Making Vapnik–Chervonenkis Bounds Accurate ⋮ Perspectives on the theory and practice of belief functions ⋮ Fast retraining from SDM ⋮ A model of the emergence and evolution of integrated worldviews ⋮ Increasing the semantic storage density of sparse distributed memory ⋮ Associative structures for vision ⋮ Optimizing lattice-based associative memory networks by evolutionary algorithms
This page was built for publication:
