Memorization and Association on a Realistic Neural Model
From MaRDI portal
Recommendations
Cites work
Cited in
(68)- Context-dependent associations in linear distributed memories
- Cortical memory dynamics
- The nervous system might `orthogonalize' to discriminate
- A neural network model for memory retrieval in a pair association task
- Adding a bias to vector models of association memory provides item memory for free
- A theory of cerebral learning regulated by the reward system. I: Hypotheses and mathematical description
- A quantitative theory of neural computation
- The nature of the memory trace and its neurocomputational implications
- MMM -- the molecular model of memory
- Near-optimal scheduling of distributed algorithms
- Scheduling loop-free network updates: it's good to relax!
- 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 (extended abstract)
- Toward optimal bounds in the congested clique, graph connectivity and MST
- 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? A utility-based approach to protocol optimality
- Adaptively secure computation with partial erasures
- Improved analysis of deterministic load-balancing schemes
- Randomized proof-labeling schemes
- Distributed convex thresholding
- Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) 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 (extended abstract)
- On the Push\&Pull protocol for rumour spreading (extended abstract)
- 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 (extended abstract)
- Dual failure resilient BFS structure
- The hippocampus as a stable memory allocator for cortex
- Computational modelling of memory retention from synapse to behaviour
- Experience-Induced Neural Circuits That Achieve High Capacity
- A (Somewhat) New Solution to the Variable Binding Problem
- scientific article; zbMATH DE number 4079218 (Why is no real title available?)
- A learning and forgetting algorithm in associative memories: results involving pseudo-inverses
- scientific article; zbMATH DE number 1505863 (Why is no real title available?)
- Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks
- A memory model with novel behaviour in sequential learning
- Long term memory and the densest K-subgraph problem
- Overparameterized neural networks implement associative memory
- Random projection in the brain and computation with assemblies of neurons
- Neuronal integration of dynamic sources: Bayesian learning and Bayesian inference
- Scaling Laws of Associative Memory Retrieval
- Learning hierarchically-structured concepts
- Evaluating models of recognition memory using first- and second-choice responses
- On the capacity of an associative memory model based on neural cliques
- Elements for a general memory structure: properties of recurrent neural networks used to form situation models
- A model of associative learning in the mushroom body
This page was built for publication: Memorization and Association on a Realistic Neural Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673525)