Aurélien Lemay

Sylvain Salvati

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018

Machine Learning Techniques for Semistructured Data. (Techniques d'Apprentissage Automatique pour les Données Semistructurées).

[BibT_eX]

[DOI]

, 2018

2017

gMark: Schema-Driven Generation of Graphs and Queries.

[BibT_eX]

[DOI]

Guillaume Bagan

George H. L. Fletcher

Nicky Advokaat

IEEE Trans. Knowl. Data Eng., 2017

2016

Generating Flexible Workloads for Graph Databases.

[BibT_eX]

[DOI]

Guillaume Bagan

George H. L. Fletcher

Nicky Advokaat

Proc. VLDB Endow., 2016

Learning Top-Down Tree Transducers with Regular Domain Inspection.

[BibT_eX]

[DOI]

Adrien Boiret

Proceedings of the 13th International Conference on Grammatical Inference, 2016

2015

Controlling Diversity in Benchmarking Graph Databases.

[BibT_eX]

[DOI]

Guillaume Bagan

George H. L. Fletcher

Nicky Advokaat

CoRR, 2015

Sublinear DTD Validity.

[BibT_eX]

[DOI]

Antoine Ndione

Proceedings of the Language and Automata Theory and Applications, 2015

Interactive Path Query Specification on Graph Databases.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Extending Database Technology, 2015

Learning Path Queries on Graph Databases.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Extending Database Technology, 2015

2014

A Paradigm for Learning Queries on Big Data.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Bringing the Value of "Big Data" to Users, 2014

Learning Sequential Tree-to-Word Transducers.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

2013

Approximate membership for regular languages modulo the edit distance.

[BibT_eX]

[DOI]

Antoine Ndione

Theor. Comput. Sci., 2013

Query induction with schema-guided pruning strategies.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2013

2012

Learning Rational Functions.

[BibT_eX]

[DOI]

Adrien Boiret

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Normalization of Sequential Top-Down Tree-to-Word Transducers.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

2010

A learning algorithm for top-down XML transformations.

[BibT_eX]

[DOI]

Sebastian Maneth

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

Efficient inclusion checking for deterministic tree automata and XML Schemas.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Retrieving valid matches for XML keyword search.

[BibT_eX]

[DOI]

Lingbo Kong

Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Equivalence of Deterministic Nested Word to Word Transducers.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Retrieving meaningful relaxed tightest fragments for XML keyword search.

[BibT_eX]

[DOI]

Lingbo Kong

Proceedings of the EDBT 2009, 2009

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.

[BibT_eX]

[DOI]

Lingbo Kong

Proceedings of the Database Systems for Advanced Applications, 2009

2008

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

Schema-Guided Induction of Monadic Queries.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007

Interactive learning of node selecting tree transducer.

[BibT_eX]

[DOI]

Mach. Learn., 2007

2006

Identification of biRFSA languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2004

Learning regular languages using RFSAs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Learning Node Selecting Tree Transducer from Completely Annotated Examples.

[BibT_eX]

[DOI]

Julien Carme

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003

Residual Finite Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Residual Finite State Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

Learning Probabilistic Residual Finite State Automata.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Some Classes of Regular Languages Identifiable in the Limit from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Learning Regular Languages Using RFSA.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Learning Regular Languages Using Non Deterministic Finite Automata.

[BibT_eX]

[DOI]