RR2016: “On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules”
The paper “On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules” by Meghyn Bienvenu and Michaël Thomazo has been accepted for publication at RR: International Conference on Web Reasoning and Rule Systems 2016.
PVLDB 2016: “Teaching an RDBMS about ontological constraints”
“Teaching an RDBMS about ontological constraints” by Damian Bursztyn, François Goasdoué and Ioana Manolescu has been accepted for publication in PVLDB 2016.
Šejla Čebirić awarded the Google Anita Borg Scholarship
Šejla Čebirić received The Google Anita Borg Memorial Scholarship in the Europe, the Middle East and Africa region (EMEA) which aims to encourage women to excel in computing and technology, and become active role models and leaders in this field. The scholars will attend the EMEA Anita Borg Scholars’ Retreat …
MFCS 2016: “On the Complexity of Universality for Partially Ordered NFAs”
The paper “On the Complexity of Universality for Partially Ordered NFAs” by Markus Krötzsch, Tomas Masopust and Michaël Thomazo has been accepted for publication at the Mathematical Foundations of Computer Science (MFCS 2016) conference.
Michalis Vazirgiannis: Graph Degeneracy for citation networks exploration
When: Friday, June 3, at 10 AM Where: Turing building, room Flowers
Saber Salah: Parallel Itemset Mining in Massively Distributed Environments
When: Friday, May 27, at 11 Where: Turing building, room Gilles Kahn Abstract: First I will address the problem of frequent itemset mining in big data. We call for specific data placement techniques in massively distributed environments to improve the performance of parallel frequent itemset mining (PFIM) algorithms. We thoroughly …
CEDAR @ ICDE 2016
Damian presented the demo “Flexible Hybrid Stores: Constraint-Based Rewriting to the Rescue” at the 32nd IEEE International Conference on Data Engineering held in Helsinki from May 16 to 20.
VLDB 2016 demo: “Mixed-instance querying: a lightweight integration architecture for data journalism”
The demonstration “Mixed-instance querying: a lightweight integration architecture for data journalism” by Raphaël Bonaque, Bogdan Cautis, François Goasdoué, Javier Letelier, Ioana Manolescu, Oscar Mendoza, Swen Ribeiro, Xavier Tannier and Michaël Thomazo has been accepted for publication at VLDB 2016.
“Factminder” presented at the Duke University conference on automated fact-checking
At the last week Tech & Check Conference of the Duke University in North Carolina, Michaël Thomazo presented the FactMinder, our system for archiving, annotating, and querying semantic-rich Web content. The event aimed at bringing together journalists (mostly fact-checkers, from Factcheck, Politifact, Full Fact, Chequeado,…) and computer scientists in order to have a clearer …