A neural algorithm for a fundamental computing problem
From MaRDI portal
Recommendations
- A neural data structure for novelty detection
- Computation of similarity -- similarity search as computation
- A familiarity discrimination algorithm inspired by computations of the perirhinal cortex
- A biological solution to a fundamental distributed computing problem
- Neural networks and physical systems with emergent collective computational abilities
Cited in
(18)- Sparsity through evolutionary pruning prevents neuronal networks from overfitting
- Unifying Online and Offline Preference for Social Link Prediction
- scientific article; zbMATH DE number 7559100 (Why is no real title available?)
- A neural network which computes the square root
- A neural model for the p-median problem
- Index structures for fast similarity search for real vectors. II
- VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
- A neural data structure for novelty detection
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
- scientific article; zbMATH DE number 1748486 (Why is no real title available?)
- A framework for self-evolving computational material models inspired by deep learning
- Binary random projections with controllable sparsity patterns
- Bioinspired Random Projections for Robust, Sparse Classification
- The Duality Between the Perceptron Algorithm and the von Neumann Algorithm
- A basic compositional model for spiking neural networks
- Spiking neural networks through the lens of streaming algorithms
- Habituation as a neural algorithm for online odor discrimination
- Data-driven reconstruction and encoding of sparse stimuli across convergent sensory layers from downstream neuronal network dynamics
This page was built for publication: A neural algorithm for a fundamental computing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645996)
