Seminars

Links' Seminars and Public Events Add to google calendar
2019
Fri 22nd Mar
10:00 am
11:30 am
Add event to google
Seminar LINKS by Aurelien Lemay "Tutorial: Grammatical Inference"
Fri 8th Mar
11:00 am
12:00 pm
Add event to google
Seminar Momar
Title: Regular Matching and Inclusion on Compressed Tree Patterns with Context Variables

Abstract: We study the complexity of regular matching and inclusion for compressed tree patterns extended by context variables. The addition of context variables to tree patterns permits us to properly capture compressed string patterns but also compressed patterns for unranked trees with tree and hedge variables. Regular inclusion for the latter is relevant to certain query answering on Xml streams with references.
Fri 15th Feb
11:00 am
12:00 pm
Add event to google
Seminar [Florent]
Wed 13th Feb
1:30 pm
2:30 pm
Add event to google
30mn de science : Florent Capelli on Knowledge Compilation

Show in Google map
Inria salle Plénière (Bâtiment A)
Fri 1st Feb
11:00 am
12:30 pm
Add event to google
Bruno Guillon in Links' seminar
Title: Finding paths in large graphs

Abstract:
When dealing with large graphs, classical algorithms for finding paths such as Dijkstra's Algorithm are unsuitable, because they require to perform too many disk accesses. To avoid this while keeping a data structure of size quasi-linear in the size of the graph, we propose to guide the path search with a distance oracle, obtained from a topological embedding of the graph.
I will present fresh experimental research on this topic, in which we obtain graph embeddings using learning algorithms from natural language processing. On some graphs, such as the graph of publications from DBLP, our topologically-guided path search allows us to visit a small portion of the graph only, in average.
This is joint work with Charles Paperman.
Show in Google map
B21 Room
2018
Fri 23rd Nov
11:00 am
12:30 pm
Add event to google
Filip Mazowiecki in Links' seminar
Title: Containment for Probabilistic automata.

Abstract: This is an ICALP 2018 paper. We analyze when the model of probabilistic
automata has decidable properties, when restricting the ambiguity. The
notion of ambiguity is usually used in weighted automata or transducers,
but we follow a recent paper by Fijalkow, Riveros and Worrell, which
introduced this approach. We do not solve everything but our decidability
results rely unexpectedly on Schanuel's conjecture and we provide some
geometric intuition behind the hardness of the problem.
Fri 16th Nov
11:00 am
12:30 pm
Add event to google
Aurelien Lemay's Habilitation defense
Show in Google map
IRCICA
Thu 15th Nov
4:30 pm
5:30 pm
Add event to google
Andreas Maletti in Aurélien Lemay's prehabilitation seminar
Show in Google map
Lille-Salle B21
Thu 15th Nov
3:30 pm
4:30 pm
Add event to google
Henning Fernau in Aurélien Lemay's prehabilitation seminar:
Show in Google map
Lille-Salle B21
Fri 9th Nov
11:00 am
12:30 pm
Add event to google
Talk of Bruno Guillon
Abstract: The time complexity of 1-limited automata is investigated from a
descriptional complexity view point. Though the model recognizes
regular languages only, it may use quadratic time in the input length.
We show that, with a polynomial increase in size and preserving
determinism, each 1-limited automaton can be transformed into a
linear-time equivalent one. We also obtain polynomial transformations
into related models, including weight-reducing Hennie machines (i.e.,
one-tape Turing machines syntactically forced to operate in
linear-time), and we show exponential gaps for converse
transformations in the deterministic case.

Permanent link to this article: https://team.inria.fr/links/seminars/