Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 25, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Marcelo Matheus Gauy

Optimal Densities for Local Synapses in Associative Memories

Inspired by the brain, we consider a multi-associative memory model consisting of two layers of sparsely connected vertices. Second layer vertices are also sparsely connected by local edges. Pattern pairs (subsets of vertices) are stored by turning strong all the edges belonging to them. A pattern is recalled by activating it in the first layer, letting activity propagate across the network in a bootstrap percolation fashion. The multi-associative part means that every pattern in the second layer is associated with s patterns in the first layer. For values of s larger than 4, the optimal case happens in situations where the number of local connections is larger than the number of afferent ones (as is the case in many regions of the brain). This theoretical model gives insight to the importance of local connections and could explain the densities observed in the cortex. This is joint work with Florian Meier and Angelika Steger.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login