- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c25 |      | Jean Baptiste Faddoul, Boris Chidlovskii, Rémi Gilleron, Fabien Torre: Learning Multiple Tasks with Boosted Decision Trees. ECML/PKDD (1) 2012: 681-696 |
| 2010 | ||
| c24 | | Jean Baptiste Faddoul, Boris Chidlovskii, Fabien Torre, Rémi Gilleron: Boosting Multi-Task Weak Learners with Applications to Textual and Social Data. ICMLA 2010: 367-372 |
| 2009 | ||
| j9 | | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. 207(11): 1181-1208 (2009) |
| c23 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. DASFAA 2009: 543-548 |
| c22 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving meaningful relaxed tightest fragments for XML keyword search. EDBT 2009: 815-826 |
| c21 | | Lingbo Kong, Rémi Gilleron, Aurélien Lemay: Retrieving valid matches for XML keyword search. SAC 2009: 1536-1540 |
| 2008 | ||
| j8 | | Pierre Senellart, Serge Abiteboul, Rémi Gilleron: Understanding the Hidden Web. ERCIM News 2008(72) (2008) |
| c20 | | Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren: Schema-Guided Induction of Monadic Queries. ICGI 2008: 15-28 |
| c19 | | 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 |
| c18 | | Pierre Senellart, Avin Mittal, Daniel Muschick, Rémi Gilleron, Marc Tommasi: Automatic wrapper induction from hidden-web sources with domain knowledge. WIDM 2008: 9-16 |
| i2 | | François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert: On Probability Distributions for Trees: Representations, Inference and Learning. CoRR abs/0807.2983 (2008) |
| 2007 | ||
| j7 | | 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 | ||
| c17 |  | Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre: Extraction de relations dans les documents Web. EGC 2006: 415-420 |
| c16 | | Aurélien Lemay, Joachim Niehren, Rémi Gilleron: Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI 2006: 253-267 |
| c15 | | Rémi Gilleron, Florent Jousse, Isabelle Tellier, Marc Tommasi: XML Document Transformation with Conditional Random Fields. INEX 2006: 525-539 |
| c14 | | Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre: Interactive Tuples Extraction from Semi-Structured Data. Web Intelligence 2006: 997-1004 |
| i1 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. CoRR abs/cs/0609015 (2006) |
| 2005 | ||
| j6 | | François Denis, Rémi Gilleron, Fabien Letouzey: Learning from positive and unlabeled examples. Theor. Comput. Sci. 348(1): 70-83 (2005) |
| 2003 | ||
| c13 | | Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi: Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182 |
| c12 | | Francesco De Comité, Rémi Gilleron, Marc Tommasi: Learning Multi-label Alternating Decision Trees from Texts and Data. MLDM 2003: 35-49 |
| 2001 | ||
| j5 | | |
| 2000 | ||
| c11 | | Fabien Letouzey, François Denis, Rémi Gilleron: Learning from Positive and Unlabeled Examples. ALT 2000: 71-85 |
| 1999 | ||
| j4 | | Rémi Gilleron, Sophie Tison, Marc Tommasi: Set Constraints and Automata. Inf. Comput. 149(1): 1-41 (1999) |
| c10 | | Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey: Positive and Unlabeled Examples Help Learning. ALT 1999: 219-230 |
| 1997 | ||
| c9 | | |
| 1996 | ||
| c8 | | François Denis, Cyrille D'Halluin, Rémi Gilleron: PAC Learning with Simple Examples. STACS 1996: 231-242 |
| 1995 | ||
| j3 | | Rémi Gilleron, Sophie Tison: Regular Tree Languages and Rewrite Systems. Fundam. Inform. 24(1/2): 157-174 (1995) |
| 1994 | ||
| j2 | | Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Theor. Comput. Sci. 127(1): 69-98 (1994) |
| c7 | | Rémi Gilleron, Sophie Tison, Marc Tommasi: Some new Decidability Results on Positive and Negative Set Constraints. CCL 1994: 336-351 |
| 1993 | ||
| c6 | | Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints with Negated Subset Relationships. FOCS 1993: 372-380 |
| c5 | | Rémi Gilleron, Sophie Tison, Marc Tommasi: Solving Systems of Set Constraints using Tree Automata. STACS 1993: 505-514 |
| 1992 | ||
| j1 | | Sándor Vágvölgyi, Rémi Gilleron: For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bulletin of the EATCS 48: 197-209 (1992) |
| 1991 | ||
| c4 | | Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi: Bottom-Up Tree Pushdown Automata and Rewrite Systems. RTA 1991: 287-298 |
| c3 | | Rémi Gilleron: Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. STACS 1991: 148-159 |
| 1990 | ||
| c2 | | Jean-Luc Coquidé, Rémi Gilleron: Proofs and Reachablity Problem for Ground Rewrite Systems. IMYCS 1990: 120-129 |
| 1989 | ||
| c1 | | Aline Deruyver, Rémi Gilleron: The Reachability Problem for Ground TRS and Some Extensions. TAPSOFT, Vol.1 1989: 227-243 |
Data released under the ODC-BY 1.0 license — See also our legal information page