University of Cambridge > > Inference Group > Associative Memories

Associative Memories

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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