Theoretical Partial and Multiple Match Performance of Cmms

Abstract

We develop a framework for estimating the matching performance of binary correlation matrix memories (CMMs). The framework is applicable to non-recursive, fully-connected systems with binary (0,1) Hebbian weights. It can handle both the full and partial matching of single or multiple data items under non-sparse encoding. Development takes place under a… (More)

Topics

  • Presentations referencing similar topics