  We study various models of associative memories with sparse information, i.e.
a pattern to be stored is a random string of $0$s and $1$s with about $\log N$
$1$s, only. We compare different synaptic weights, architectures and retrieval
mechanisms to shed light on the influence of the various parameters on the
storage capacity.
