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: Tuesday, October 27, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Felix Weissenberger

On a One-Shot Model for Sequence Learning

Motivated by a system to store and retrieve sequences in a neural network, we study the following problem. Given a graph and a subset of its vertices A0 we define a sequence of subsets A0,…,Al recursively: Ai+1 is the set of vertices with at least k neighbours into the set Ai. Our goal is to find a sparse random graph which contains a long sequence such that the Ai's have roughly the same specified size and do not overlap too much. For the right p, Gnp contains such a sequence of logarithmic length. We show that starting with a slightly larger p and deleting a small fraction of the edges (constrained by the motivating system) yields a sequence of polynomial length. This is joint work with H. Einarsson, J. Lengler, F. Meier, and A. 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