GALaC team seminar

The GALaC team seminar is organized on a regular basis on Friday at 14:00 in the PCRI building (650) at LISN.

Recent and up-coming seminars

Skipless chain decompositions and improved poset saturation bounds

-- Paul Bastide (LaBRI (Bordeaux))

summary: We show that given m disjoint chains in the Boolean lattice, we can create m disjoint skipless chains that cover the same elements (where we call a chain skipless if any two consecutive elements differ in size by exactly one). By using this result we are able to answer ...

Asymptotic behaviour of cyclic automata

-- Benjamin Hellouin de Menibus (LISN, Galac)

summary: Cyclic dominance describes models where different states (species, strategies...) are in some cyclic prey-predator relationship: for example, rock-paper-scissors. This occurs in many contexts such as ecological systems, evolutionary games on graphs, etc. Many models exhibit heteroclinic cycles where one state dominates almost the whole space before being replaced by ...

La boîte aux lettres avait des dents : propriétés des pièges à facteurs dans le cas bi-infini

-- Pierre Béaur (LISN, Galac)

summary: En 2017, en algorithmique de texte, Prezza a introduit la notion de piège à facteurs : pour un mot fini w, un piège à facteurs pour w est un ensemble E de positions de w telles que pour tout facteur f de w, il existe une position de E qui ...

Complexity of neural network training and complexity proofs bypassing frontier issues

-- Valentin Dardilhac (LISN, Galac)

summary: We study the complexity of the neural network training decision
problem in two different contexts. First, in the general context, this
problem has been shown to be in extensions of the class ∃R. We have
been able to show that whenever the activation functions are Lipschitz
functions and the ...

See all

Translations: fr