Capacity analysis of vector symbolic architectures
From MaRDI portal
Cites work
- A simple neural network generating an interactive memory
- A theoretical perspective on hyperdimensional computing
- An improved data stream summary: the count-min sketch and its applications
- Correlation Matrix Memories
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Distance-Sensitive Bloom Filters
- Extensions of Lipschitz mappings into a Hilbert space
- Hanson-Wright inequality and sub-Gaussian concentration
- High-dimensional probability. An introduction with applications in data science
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Network Applications of Bloom Filters: A Survey
- Neural networks and physical systems with emergent collective computational abilities
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On a model of associative memory with huge storage capacity
- On the false-positive rate of Bloom filters
- Simple analyses of the sparse Johnson-Lindenstrauss transform
- Sketching as a tool for numerical linear algebra
- Space/time trade-offs in hash coding with allowable errors
- Sparser Johnson-Lindenstrauss transforms
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Tensor product variable binding and the representation of symbolic structures in connectionist systems
- The capacity of the Hopfield associative memory
This page was built for publication: Capacity analysis of vector symbolic architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307196)
