Efficient and robust associative memory from a generalized Bloom filter

DOI10.1007/s00422-012-0494-6zbMath1267.92011OpenAlexW1993196049WikidataQ50949465 ScholiaQ50949465MaRDI QIDQ353819

P. A. Sterne

Publication date: 16 July 2013

Published in: Biological Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00422-012-0494-6

zbMATH Keywords

randomized storage

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Theory of data (68P99) Information storage and retrieval of data (68P20)

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving recall from an associative memory
• Less hashing, same performance: Building a better Bloom filter
• Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states
• Capacity and information efficiency of the associative net
• Randomly connected sigma–pi neurons can form associator networks
• Factor graphs and the sum-product algorithm
• Network Applications of Bloom Filters: A Survey
• Neural networks and physical systems with emergent collective computational abilities.
• Less Hashing, Same Performance: Building a Better Bloom Filter
• Probability and Computing
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Efficient and robust associative memory from a generalized Bloom filter