Aurélien Lemay

39 papers A* 2A 2B 7C 6Misc 1Journal 12Unranked 8
YearRankTypeTitle / Venue / Authors
2022 A conf
Inference of Shape Graphs for Graph Databases.
ICDT
Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
2021 J jnl
Inference of Shape Expression Schemas Typed RDF Graphs.
CoRR
Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
2020 B conf
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead.
MFCS
Paul Gallot, Aurélien Lemay, Sylvain Salvati
2018 — book
Machine Learning Techniques for Semistructured Data. (Techniques d'Apprentissage Automatique pour les Données Semistructurées).
Aurélien Lemay
2017 A* conf
gMark: Schema-Driven Generation of Graphs and Queries.
ICDE
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2017 J jnl
gMark: Schema-Driven Generation of Graphs and Queries.
IEEE Trans. Knowl. Data Eng.
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2016 J jnl
Generating Flexible Workloads for Graph Databases.
Proc. VLDB Endow.
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2016 — conf
Learning Top-Down Tree Transducers with Regular Domain Inspection.
ICGI
Adrien Boiret, Aurélien Lemay, Joachim Niehren
2015 J jnl
Controlling Diversity in Benchmarking Graph Databases.
CoRR
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
2015 B conf
Interactive Path Query Specification on Graph Databases.
EDBT
Angela Bonifati, Radu Ciucanu, Aurélien Lemay
2015 B conf
Learning Path Queries on Graph Databases.
EDBT
Angela Bonifati, Radu Ciucanu, Aurélien Lemay
2015 C conf
Sublinear DTD Validity.
LATA
Antoine Ndione, Aurélien Lemay, Joachim Niehren
2014 — conf
A Paradigm for Learning Queries on Big Data.
Data4U@VLDB
Angela Bonifati, Radu Ciucanu, Aurélien Lemay, Slawek Staworko
2014 C conf
Learning Sequential Tree-to-Word Transducers.
LATA
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2013 J jnl
Approximate membership for regular languages modulo the edit distance.
Theor. Comput. Sci.
Antoine Ndione, Aurélien Lemay, Joachim Niehren
2013 J jnl
Query induction with schema-guided pruning strategies.
J. Mach. Learn. Res.
Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron
2012 C conf
Learning Rational Functions.
Developments in Language Theory
Adrien Boiret, Aurélien Lemay, Joachim Niehren
2011 C conf
Normalization of Sequential Top-Down Tree-to-Word Transducers.
LATA
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2010 A* conf
A learning algorithm for top-down XML transformations.
PODS
Aurélien Lemay, Sebastian Maneth, Joachim Niehren
2009 J jnl
Efficient inclusion checking for deterministic tree automata and XML Schemas.
Inf. Comput.
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2009 B conf
Equivalence of Deterministic Nested Word to Word Transducers.
FCT
Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
2009 B conf
Retrieving meaningful relaxed tightest fragments for XML keyword search.
EDBT
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
2009 Misc conf
Retrieving valid matches for XML keyword search.
SAC
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
2009 B conf
ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.
DASFAA
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
2008 C conf
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
LATA
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2008 — conf
Schema-Guided Induction of Monadic Queries.
ICGI
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2007 J jnl
Interactive learning of node selecting tree transducer.
Mach. Learn.
Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
2006 J jnl
Identification of biRFSA languages.
Theor. Comput. Sci.
Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
2006 — conf
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
ICGI
Aurélien Lemay, Joachim Niehren, Rémi Gilleron
2006 J jnl
Residual Finite Tree Automata
CoRR
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
2004 — conf
Learning Node Selecting Tree Transducer from Completely Annotated Examples.
ICGI
Julien Carme, Aurélien Lemay, Joachim Niehren
2004 J jnl
Learning regular languages using RFSAs.
Theor. Comput. Sci.
François Denis, Aurélien Lemay, Alain Terlutte
2003 C conf
Residual Finite Tree Automata.
Developments in Language Theory
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
2002 — conf
Learning Probabilistic Residual Finite State Automata.
ICGI
Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont
2002 J jnl
Residual Finite State Automata.
Fundam. Informaticae
François Denis, Aurélien Lemay, Alain Terlutte
2002 — conf
Some Classes of Regular Languages Identifiable in the Limit from Positive Data.
ICGI
François Denis, Aurélien Lemay, Alain Terlutte
2001 B conf
Learning Regular Languages Using RFSA.
ALT
François Denis, Aurélien Lemay, Alain Terlutte
2001 A conf
Residual Finite State Automata.
STACS
François Denis, Aurélien Lemay, Alain Terlutte
2000 — conf
Learning Regular Languages Using Non Deterministic Finite Automata.
ICGI
François Denis, Aurélien Lemay, Alain Terlutte