Travelled to:1 × France
1 × Hungary
1 × Taiwan
2 × USA
3 × Spain
Collaborated with:J.Niehren R.Gilleron M.Tommasi G.Laurence S.Staworko A.Ndione A.Boiret S.Maneth L.Kong J.Champavère J.Carme A.Terlutte
Talks about:tree (4) learn (3) transduc (2) sequenti (2) automata (2) valid (2) word (2) down (2) xml (2) top (2)
Person: Aurélien Lemay
DBLP: Lemay:Aur=eacute=lien
Contributed to:
20152014
20122011
2010
200920082003Wrote 8 papers:
- LATA-2015-NdioneLN #sublinear
- Sublinear DTD Validity (AN, AL, JN), pp. 739–751.
- LATA-2014-LaurenceLNST #learning #transducer
- Learning Sequential Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 490–502.
- DLT-2012-BoiretLN #learning
- Learning Rational Functions (AB, AL, JN), pp. 273–283.
- LATA-2011-LaurenceLNST #normalisation #top-down #transducer
- Normalization of Sequential Top-Down Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 354–365.
- PODS-2010-LemayMN #algorithm #learning #top-down #xml
- A learning algorithm for top-down XML transformations (AL, SM, JN), pp. 285–296.
- SAC-2009-KongGL #keyword #xml
- Retrieving valid matches for XML keyword search (LK, RG, AL), pp. 1536–1540.
- LATA-2008-ChampavereGLN #automaton #performance
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.
- DLT-2003-CarmeGLTT #automaton #finite
- Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.