2009 |
18 | EE | Lingbo Kong,
Rémi Gilleron,
Aurélien Lemay:
ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.
DASFAA 2009: 543-548 |
17 | EE | Lingbo Kong,
Rémi Gilleron,
Aurélien Lemay:
Retrieving meaningful relaxed tightest fragments for XML keyword search.
EDBT 2009: 815-826 |
16 | EE | Lingbo Kong,
Rémi Gilleron,
Aurélien Lemay:
Retrieving valid matches for XML keyword search.
SAC 2009: 1536-1540 |
2008 |
15 | EE | Jérôme Champavère,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Schema-Guided Induction of Monadic Queries.
ICGI 2008: 15-28 |
14 | EE | Jérôme Champavère,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
LATA 2008: 184-195 |
2007 |
13 | EE | Julien Carme,
Rémi Gilleron,
Aurélien Lemay,
Joachim Niehren:
Interactive learning of node selecting tree transducer.
Machine Learning 66(1): 33-67 (2007) |
2006 |
12 | EE | Aurélien Lemay,
Joachim Niehren,
Rémi Gilleron:
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
ICGI 2006: 253-267 |
11 | EE | Julien Carme,
Rémi Gilleron,
Aurélien Lemay,
Alain Terlutte,
Marc Tommasi:
Residual Finite Tree Automata
CoRR abs/cs/0609015: (2006) |
10 | EE | Michel Latteux,
Aurélien Lemay,
Yves Roos,
Alain Terlutte:
Identification of biRFSA languages.
Theor. Comput. Sci. 356(1-2): 212-223 (2006) |
2004 |
9 | EE | Julien Carme,
Aurélien Lemay,
Joachim Niehren:
Learning Node Selecting Tree Transducer from Completely Annotated Examples.
ICGI 2004: 91-102 |
8 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning regular languages using RFSAs.
Theor. Comput. Sci. 313(2): 267-294 (2004) |
2003 |
7 | EE | Julien Carme,
Rémi Gilleron,
Aurélien Lemay,
Alain Terlutte,
Marc Tommasi:
Residual Finite Tree Automata.
Developments in Language Theory 2003: 171-182 |
2002 |
6 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Some Classes of Regular Languages Identifiable in the Limit from Positive Data.
ICGI 2002: 63-76 |
5 | EE | Yann Esposito,
Aurélien Lemay,
François Denis,
Pierre Dupont:
Learning Probabilistic Residual Finite State Automata.
ICGI 2002: 77-91 |
4 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Residual Finite State Automata.
Fundam. Inform. 51(4): 339-368 (2002) |
2001 |
3 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning Regular Languages Using RFSA.
ALT 2001: 348-363 |
2 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Residual Finite State Automata.
STACS 2001: 144-157 |
2000 |
1 | | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata.
ICGI 2000: 39-50 |