Improving Sparse Associative Memories by Escaping from Bogus Fixed Points
Wed, 10/02/2013 - 12:34 — zhe.yao
| Title | Improving Sparse Associative Memories by Escaping from Bogus Fixed Points |
| Publication Type | Journal Article |
| Year of Publication | 2013 |
| Authors | Yao, Z., V. Gripon, and M. G. Rabbat |
| Keywords | Associative Memory, Branch and Bound Algorithm, Maximum Clique Problem, Partite Graph, Recurrent Neural Networks |
| URL | http://arxiv.org/abs/1308.6003 |
- Login to post comments
- Tagged
- XML
- BibTex
- Google Scholar