Valda Seminar: Bruno Guillon

Bruno Guillon, Inria Lille 3 May 2019, 10:30-11:30 ENS, S16 Finding paths in large data graphs 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 the cost of these expensive accesses, while…

Continue reading

Valda Seminar: Camille Bourgaux

8 March 2019, 10:30-11:30 ENS, S16 Querying Attributed DL-Lite Ontologies Using Provenance Semirings Attributed description logic is a recently proposed formalism, targeted for graph-based representation formats, which enriches description logic concepts and roles with finite sets of attribute-value pairs, called annotations. One of the most important uses of annotations is…

Continue reading

Valda Seminar: Leonid Libkin

Leonid Libkin, University of Edinburgh 28 January 2019, 14:30-15:30 Inria, 2 rue Simone Iff, 75012 Paris, building C, room Jacques-Louis Lions 2 Can We Trust SQL as a Data Analytics Tool? Multiple surveys show that SQL and relational databases remain the most common tools used by data scientists. But can…

Continue reading

Karima Rafes’s PhD Defense

Karima’s thesis, entitled “Linked Data at university: the LinkedWiki platform” will take place on Friday, January 25, 2019 at 14:30 at Bât 650 Ada Lovelace of the LRI, Laboratoire de Recherche en Informatique, in the room “Salle des thèses”. The defense will be in French. The jury is composed by…

Continue reading

Valda Seminar: Jill-Jênn Vie

Jill-Jênn Vie, RIKEN AIP (Tokyo) 21 December 2018, 10:30-11:30 ENS, S16 Knowledge Tracing Machines – Factorization Machines for Knowledge Tracing Knowledge tracing is a sequence prediction problem where the goal is to predict the outcomes of students over questions as they are interacting with a learning platform. By tracking the…

Continue reading

Valda Seminar: David Carral

David Carral, TU Dresden 14 December 2018, 10:30-11:30 ENS, S16 Reasoning over Existential Rules with Acyclicity Notions The chase is a sound and complete (albeit non-terminating) algorithm for conjunctive query answering over ontologies of existential rules. On the theoretical side, we develop sufficient conditions to guarantee its termination (i.e., acyclicity…

Continue reading