University of Cambridge > Talks.cam > Inference Group > Associative Memories

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Associative Memories

Download to your calendar using vCal

If you have a question about this talk, please contact Philip Sterne .

(This talk was postponed from 20 August)

In this talk I’ll discuss the results I’ve obtained for a simple associative memory. An associative memory lets one store (key, value) pairs in such a way that when presented with a key the corresponding value is returned. I’ll present a method which uses randomization to avoid storing the keys. (It is similar in spirit to the Bloom filter.)

I will also compare and contrast my work with: Willshaw nets and Distributed Phase codes.

This talk is part of the Inference Group series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Faculty of Education, Mary Allan Building,Boulind 8 & 9, Homerton College, Hills Road, Cambridge CB2 8PQ Harker 2 lecture room, Department of Earth Sciences, Downing Site

Other talks

CSAR lecture: Decarbonizing road freight (TBC) Title to be confirmed Tea and Coffee Break Title to be confirmed Title to be confirmed A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity