Memorization and Association on a Realistic Neural Model
From MaRDI portal
Publication:4673525
DOI10.1162/0899766053019890zbMath1089.68612OpenAlexW2142423740WikidataQ42652151 ScholiaQ42652151MaRDI QIDQ4673525
Publication date: 29 April 2005
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/0899766053019890
Related Items
A quantitative theory of neural computation ⋮ Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks ⋮ Learning hierarchically-structured concepts ⋮ Leveraging multiple channels in ad hoc networks ⋮ A (Somewhat) New Solution to the Variable Binding Problem ⋮ Algebraic methods in the congested clique ⋮ Near-Optimal Scheduling of Distributed Algorithms ⋮ Scheduling Loop-free Network Updates ⋮ New Routing Techniques and their Applications ⋮ Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata ⋮ Fast and Exact Majority in Population Protocols ⋮ Distributed House-Hunting in Ant Colonies ⋮ Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication ⋮ Near-Optimal Distributed Maximum Flow ⋮ Toward Optimal Bounds in the Congested Clique ⋮ Fast Distributed Almost Stable Matchings ⋮ A (Truly) Local Broadcast Layer for Unreliable Radio Networks ⋮ Efficient Communication in Cognitive Radio Networks ⋮ A Local Broadcast Layer for the SINR Network Model ⋮ Fast Partial Distance Estimation and Applications ⋮ Trading Fences with RMRs and Separating Memory Models ⋮ The Price of being Adaptive ⋮ On the Time and Space Complexity of ABA Prevention and Detection ⋮ Impossibility Results for Distributed Transactional Memory ⋮ Safety-Liveness Exclusion in Distributed Computing ⋮ Lock-Free Algorithms under Stochastic Schedulers ⋮ On the Space Complexity of Set Agreement ⋮ How Fair is Your Protocol? ⋮ Adaptively Secure Computation with Partial Erasures ⋮ Improved Analysis of Deterministic Load-Balancing Schemes ⋮ Randomized Proof-Labeling Schemes ⋮ Distributed Convex Thresholding ⋮ Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks ⋮ On Information Complexity in the Broadcast Model ⋮ How To Elect a Leader Faster than a Tournament ⋮ The Weakest Failure Detector for Eventual Consistency ⋮ Limitations of Highly-Available Eventually-Consistent Data Stores ⋮ Computing Weak Consistency in Polynomial Time ⋮ On the Push&Pull Protocol for Rumour Spreading ⋮ Distributed Resource Discovery in Sub-Logarithmic Time ⋮ The Cost of Synchronizing Multiple-Access Channels ⋮ Towards Optimal Synchronous Counting ⋮ Fault-Tolerant Consensus in Directed Graphs ⋮ Minimal Synchrony for Byzantine Consensus ⋮ Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems ⋮ Dual Failure Resilient BFS Structure ⋮ Experience-Induced Neural Circuits That Achieve High Capacity ⋮ The Hippocampus as a Stable Memory Allocator for Cortex ⋮ Neuronal integration of dynamic sources: Bayesian learning and Bayesian inference
Cites Work
This page was built for publication: Memorization and Association on a Realistic Neural Model
