| Tree automata techniques and applications H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ... | 2007 | 2008 |
| Learning from positive and unlabeled examples F Denis, R Gilleron, F Letouzey Theoretical Computer Science 348 (1), 70-83, 2005 | 353* | 2005 |
| Learning multi-label alternating decision trees from texts and data F De Comité, R Gilleron, M Tommasi International workshop on machine learning and data mining in pattern …, 2003 | 291 | 2003 |
| Positive and unlabeled examples help learning F De Comité, F Denis, R Gilleron, F Letouzey International conference on algorithmic learning theory, 219-230, 1999 | 158 | 1999 |
| Text classification from positive and unlabeled examples F Denis, R Gilleron, M Tommasi Proceedings of the 9th International Conference on Information Processing …, 2002 | 150 | 2002 |
| Text classification and co-training from positive and unlabeled examples F Denis, A Laurent, R Gilleron, M Tommasi Proceedings of the ICML 2003 workshop: the continuum from labeled to …, 2003 | 115 | 2003 |
| Set constraints and automata R Gilleron, S Tison, M Tommasi Information and Computation 149 (1), 1-41, 1999 | 111* | 1999 |
| Bottom-up tree pushdown automata: classification and connection with rewrite systems JL Coquidé, M Dauchet, R Gilleron, S Vágvölgyi Theoretical Computer Science 127 (1), 69-98, 1994 | 88 | 1994 |
| Solving systems of set constraints with negated subset relationships R Gilleron, S Tison, M Tommasi Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 372-380, 1993 | 86 | 1993 |
| Retrieving meaningful relaxed tightest fragments for xml keyword search L Kong, R Gilleron, AL Mostrare Proceedings of the 12th International Conference on Extending Database …, 2009 | 74 | 2009 |
| Automatic wrapper induction from hidden-web sources with domain knowledge P Senellart, A Mittal, D Muschick, R Gilleron, M Tommasi Proceedings of the 10th ACM workshop on Web information and data management …, 2008 | 69 | 2008 |
| Interactive learning of node selecting tree transducer J Carme, R Gilleron, A Lemay, J Niehren Machine Learning 66 (1), 33-67, 2007 | 68 | 2007 |
| Decision problems for term rewriting systems and recognizable tree languages R Gilleron Annual Symposium on Theoretical Aspects of Computer Science, 148-159, 1991 | 46 | 1991 |
| PAC learning with simple examples F Denis, C D'Halluin, R Gilleron Annual Symposium on Theoretical Aspects of Computer Science, 231-242, 1996 | 36 | 1996 |
| Bottom-up tree pushdown automata and rewrite systems JL Coquidé, M Dauchet, R Gilleron, S Vágvölgyi International Conference on Rewriting Techniques and Applications, 287-298, 1991 | 33 | 1991 |
| Boosting multi-task weak learners with applications to textual and social data JB Faddoul, B Chidlovskii, F Torre, R Gilleron 2010 Ninth International Conference on Machine Learning and Applications …, 2010 | 32 | 2010 |
| Learning multiple tasks with boosted decision trees JB Faddoul, B Chidlovskii, R Gilleron, F Torre Joint European Conference on Machine Learning and Knowledge Discovery in …, 2012 | 31 | 2012 |
| The reachability problem for ground TRS and some extensions A Deruyver, R Gilleron Colloquium on Trees in Algebra and Programming, 227-243, 1989 | 31 | 1989 |
| For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable. S Vágvölgyi, R Gilleron Bulletin-European Association for Theoretical Computer Science 48, 197--209, 1992 | 30 | 1992 |
| Residual finite tree automata J Carme, R Gilleron, A Lemay, A Terlutte, M Tommasi International Conference on Developments in Language Theory, 171-182, 2003 | 27 | 2003 |
