BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:616@lincs.fr
DTSTART;TZID=Europe/Paris:20210421T140000
DTEND;TZID=Europe/Paris:20210421T150000
DTSTAMP:20210423T065428Z
URL:https://www.lincs.fr/events/seminar-talk-by-p-jacquet-and-d-milioris/
SUMMARY:Pattern Matching\, text generation and sequence complexity
DESCRIPTION:Pattern matching is a powerful tool used on many kinds of data
 as long as they stand on a linear support such as texts or other sequences.
 It can also be extended to regular supports standing in any Euclidian
 space. It constitutes the engine of the most powerful compression
 algorithms on texts and also the foundation of many universal predictors
 over time sequences. Recently pattern matching has been applied in short
 text classification under the name “Joint Complexity” in a perspective
 of Accelerated Artificial Intelligence. One of the interesting aspects of
 pattern matching is that it is based on extremely strong foundations in
 information theory and in the asymptotic analysis of algorithms. In
 particular when the source of sequence is well defined and parametrized. We
 will investigate the special case of Markov source models and show how they
 are “good enough” to model natural language texts. We will present some
 small games which illustrate this fact\, in parallel with the description
 of deeper theoretical results.
CATEGORIES:Seminars,Youtube
LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20210328T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR