{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:08:55Z","timestamp":1760404135306},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T00:00:00Z","timestamp":1340409600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Biol Cybern"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00422-012-0494-6","type":"journal-article","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T19:01:01Z","timestamp":1340391661000},"page":"271-281","source":"Crossref","is-referenced-by-count":3,"title":["Efficient and robust associative memory from a generalized Bloom filter"],"prefix":"10.1007","volume":"106","author":[{"given":"P.","family":"Sterne","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,23]]},"reference":[{"issue":"3","key":"494_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1108\/eb007637","volume":"4","author":"I Aleksander","year":"1984","unstructured":"Aleksander I, Thomas W, Bowden P (1984) WISARD, a radical step forward in image recognition. Sensor Review 4(3): 120\u2013124","journal-title":"Sensor Review"},{"key":"494_CR2","unstructured":"Bear M, Connors B, Paradiso M (2007) Neuroscience: exploring the brain. Lippincott Williams & Wilkins, Baltimore"},{"key":"494_CR3","volume-title":"Pattern recognition and machine learning","author":"C Bishop","year":"2006","unstructured":"Bishop C (2006) Pattern recognition and machine learning. Springer, New York"},{"issue":"7","key":"494_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom B (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7): 422\u2013426","journal-title":"Commun ACM"},{"key":"494_CR5","doi-asserted-by":"crossref","unstructured":"Bogacz R, Brown M, Giraud-Carrier C (1999) High capacity neural networks for familiarity discrimination. In: Proceedings of ICANN\u201999. ICANN, Edinburgh, pp 773\u2013778","DOI":"10.1049\/cp:19991205"},{"issue":"4","key":"494_CR6","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder A, Mitzenmacher M (2004) Network applications of Bloom filters: a survey. Internet Math 1(4): 485\u2013509","journal-title":"Internet Math"},{"issue":"3","key":"494_CR7","first-page":"293","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan L, Cao P, Almeida J, Broder A (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans Netw (TON) 8(3): 293","journal-title":"IEEE\/ACM Trans Netw (TON)"},{"key":"494_CR8","doi-asserted-by":"crossref","unstructured":"Graham B, Willshaw D (1995) Improving recall from an associative memory. Biol Cybern 72:337\u2013346. doi: 10.1007\/BF00202789","DOI":"10.1007\/BF00202789"},{"key":"494_CR9","doi-asserted-by":"crossref","unstructured":"Graham B, Willshaw D (1996) Information efficiency of the associative net at arbitrary coding rates. Artif Neural Netw ICANN 96:35\u201340","DOI":"10.1007\/3-540-61510-5_10"},{"issue":"1","key":"494_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1088\/0954-898X\/8\/1\/005","volume":"8","author":"B Graham","year":"1997","unstructured":"Graham B, Willshaw D (1997) Capacity and information efficiency of the associative net. Netw Comput Neural Syst 8(1): 35\u201354","journal-title":"Netw Comput Neural Syst"},{"key":"494_CR11","unstructured":"Hinton G, McClelland J, Rumelhart D (1984) Distributed representations. Computer Science Department, Carnegie Mellon University, Pittsburgh"},{"issue":"8","key":"494_CR12","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"JJ Hopfield","year":"1982","unstructured":"Hopfield JJ (1982) Neural networks and physical systems with emergent collective computational abilities. Proc Natl Acad Sci 79(8): 2554","journal-title":"Proc Natl Acad Sci"},{"key":"494_CR13","unstructured":"Kanerva P (1988) Sparse distributed memory. The MIT Press, Cambridge"},{"key":"494_CR14","doi-asserted-by":"crossref","unstructured":"Kirsch A, Mitzenmacher M (2006) Distance-sensitive bloom filters. In: Proceedings of the eighth workshop on algorithm engineering and experiments and the third workshop on analytic algorithmics and combinatorics. ALENEX, Miami","DOI":"10.1137\/1.9781611972863.4"},{"issue":"2","key":"494_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/rsa.20208","volume":"33","author":"A Kirsch","year":"2008","unstructured":"Kirsch A, Mitzenmacher M (2008) Less hashing, same performance: building a better Bloom filter. Random Struct Algor 33(2): 187\u2013218","journal-title":"Random Struct Algor"},{"key":"494_CR16","unstructured":"Knuth D (1973) The art of computer programming: sorting and searching, vol. 3. Addison Wesley, Reading"},{"issue":"2","key":"494_CR17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F Kschischang","year":"2001","unstructured":"Kschischang F, Frey B, Loeliger H (2001) Factor graphs and the sum\u2013product algorithm. IEEE Trans Inform Theory 47(2): 498\u2013519","journal-title":"IEEE Trans Inform Theory"},{"issue":"12","key":"494_CR18","doi-asserted-by":"crossref","first-page":"1677","DOI":"10.1038\/nn1561","volume":"8","author":"M Lengyel","year":"2005","unstructured":"Lengyel M, Kwag J, Paulsen O, Dayan P (2005) Matching storage and recall: hippocampal spike timing-dependent plasticity and phase response curves. Nature Neurosci 8(12): 1677\u20131683","journal-title":"Nature Neurosci"},{"key":"494_CR19","unstructured":"MacKay DJC (2003) Information theory, inference, and learning algorithms. Cambridge University Press, Cambridge"},{"key":"494_CR20","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511813603"},{"issue":"2","key":"494_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1088\/0954-898X\/3\/2\/006","volume":"3","author":"G Palm","year":"1992","unstructured":"Palm G, Sommer F (1992) Information capacity in recurrent McCulloch\u2013Pitts networks with sparsely coded memory states. Netw Comput Neural Syst 3(2): 177\u2013186","journal-title":"Netw Comput Neural Syst"},{"key":"494_CR22","doi-asserted-by":"crossref","unstructured":"Palm G, Sommer F (1996) Associative data storage and retrieval in neural networks. In: Domani E, van Hemmen J, Schulten K (eds) Models of neural networks III association, generalization and represantation. Springer, Berlin, pp 79\u2013118","DOI":"10.1007\/978-1-4612-0723-8_3"},{"issue":"4","key":"494_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1088\/0954-898X\/11\/4\/305","volume":"11","author":"T Plate","year":"2000","unstructured":"Plate T (2000) Randomly connected sigma-pi neurons can form associator networks. Netw Comput Neural Syst 11(4): 321\u2013332","journal-title":"Netw Comput Neural Syst"},{"issue":"3","key":"494_CR24","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/0893-6080(95)00112-3","volume":"9","author":"F Schwenker","year":"1996","unstructured":"Schwenker F, Sommer F, Palm G (1996) Iterative retrieval of sparsely coded associative memory patterns. Neural Netw 9(3): 445\u2013455","journal-title":"Neural Netw"},{"issue":"4","key":"494_CR25","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/72.701183","volume":"9","author":"F Sommer","year":"1998","unstructured":"Sommer F, Dayan P (1998) Bayesian retrieval in associative memories with storage errors. IEEE Trans Neural Netw 9(4): 705\u2013713","journal-title":"IEEE Trans Neural Netw"},{"key":"494_CR26","unstructured":"Sterne P (2011) Distributed associative memory. PhD thesis, Cambridge University, Cambridge"},{"issue":"5197","key":"494_CR27","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1038\/222960a0","volume":"222","author":"D Willshaw","year":"1969","unstructured":"Willshaw D, Buneman O, Longuet-Higgins H (1969) Non-holographic associative memory. Nature 222(5197): 960\u2013962","journal-title":"Nature"}],"container-title":["Biological Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00422-012-0494-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00422-012-0494-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00422-012-0494-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T20:31:17Z","timestamp":1559075477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00422-012-0494-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,23]]},"references-count":27,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["494"],"URL":"https:\/\/doi.org\/10.1007\/s00422-012-0494-6","relation":{},"ISSN":["0340-1200","1432-0770"],"issn-type":[{"value":"0340-1200","type":"print"},{"value":"1432-0770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,23]]}}}