Rémi Gilleron

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2010
35Boosting Multi-Task Weak Learners with Applications to Textual and Social Data. Jean Baptiste Faddoul, Boris Chidlovskii, Fabien Torre, Rémi Gilleron. ICMLA 2010, 367-372. Web SearchBibTeXDownload
2009
34ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. Lingbo Kong, Rémi Gilleron, Aurélien Lemay. DASFAA 2009, 543-548. Web SearchBibTeXDownload
33Retrieving meaningful relaxed tightest fragments for XML keyword search. Lingbo Kong, Rémi Gilleron, Aurélien Lemay. EDBT 2009, 815-826. Web SearchBibTeXDownload
32Efficient inclusion checking for deterministic tree automata and XML Schemas. Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Inf. Comput. (207): 1181-1208 (2009). Web SearchBibTeXDownload
31Retrieving valid matches for XML keyword search. Lingbo Kong, Rémi Gilleron, Aurélien Lemay. SAC 2009, 1536-1540. Web SearchBibTeXDownload
2008
30On Probability Distributions for Trees: Representations, Inference and Learning. François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert. CoRR (abs/0807.2983) (2008). Web SearchBibTeXDownload
29Understanding the Hidden Web. Pierre Senellart, Serge Abiteboul, Rémi Gilleron. ERCIM News (2008) (2008). Web SearchBibTeXDownload
28Schema-Guided Induction of Monadic Queries. Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. ICGI 2008, 15-28. Web SearchBibTeXDownload
27Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. LATA 2008, 184-195. Web SearchBibTeXDownload
26Automatic wrapper induction from hidden-web sources with domain knowledge. Pierre Senellart, Avin Mittal, Daniel Muschick, Rémi Gilleron, Marc Tommasi. WIDM 2008, 9-16. Web SearchBibTeXDownload
2007
25Interactive learning of node selecting tree transducer. Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. Machine Learning (66): 33-67 (2007). Web SearchBibTeXDownload
2006
24Residual Finite Tree Automata. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi. CoRR (abs/cs/0609015) (2006). Web SearchBibTeXDownload
23Extraction de relations dans les documents Web. Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre. EGC 2006, 415-420. Web SearchBibTeX
22Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. Aurélien Lemay, Joachim Niehren, Rémi Gilleron. ICGI 2006, 253-267. Web SearchBibTeXDownload
21XML Document Transformation with Conditional Random Fields. Rémi Gilleron, Florent Jousse, Isabelle Tellier, Marc Tommasi. INEX 2006, 525-539. Web SearchBibTeXDownload
20Interactive Tuples Extraction from Semi-Structured Data. Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre. Web Intelligence 2006, 997-1004. Web SearchBibTeXDownload
2005
19Learning from positive and unlabeled examples. François Denis, Rémi Gilleron, Fabien Letouzey. Theor. Comput. Sci. (348): 70-83 (2005). Web SearchBibTeXDownload
2003
18Residual Finite Tree Automata. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi. Developments in Language Theory 2003, 171-182. Web SearchBibTeXDownload
17Learning Multi-label Alternating Decision Trees from Texts and Data. Francesco De Comité, Rémi Gilleron, Marc Tommasi. MLDM 2003, 35-49. Web SearchBibTeXDownload
2001
16PAC Learning under Helpful Distributions. François Denis, Rémi Gilleron. ITA (35): 129-148 (2001). Web SearchBibTeXDownload
2000
15Learning from Positive and Unlabeled Examples. Fabien Letouzey, François Denis, Rémi Gilleron. ALT 2000, 71-85. Web SearchBibTeXDownload
1999
14Positive and Unlabeled Examples Help Learning. Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey. ATL 1999, 219-230. Web SearchBibTeXDownload
13Set Constraints and Automata. Rémi Gilleron, Sophie Tison, Marc Tommasi. Inf. Comput. (149): 1-41 (1999). Web SearchBibTeXDownload
1997
12PAC Learning under Helpful Distributions. François Denis, Rémi Gilleron. ALT 1997, 132-145. Web SearchBibTeXDownload
1996
11PAC Learning with Simple Examples. François Denis, Cyrille D'Halluin, Rémi Gilleron. STACS 1996, 231-242. Web SearchBibTeXDownload
1995
10Regular Tree Languages and Rewrite Systems. Rémi Gilleron, Sophie Tison. Fundam. Inform. (24): 157-174 (1995). Web SearchBibTeXDownload
1994
9Some new Decidability Results on Positive and Negative Set Constraints. Rémi Gilleron, Sophie Tison, Marc Tommasi. CCL 1994, 336-351. Web SearchBibTeXDownload
8Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi. Theor. Comput. Sci. (127): 69-98 (1994). Web SearchBibTeXDownload
1993
7Solving Systems of Set Constraints with Negated Subset Relationships. Rémi Gilleron, Sophie Tison, Marc Tommasi. FOCS 1993, 372-380. Web SearchBibTeXDownload
6Solving Systems of Set Constraints using Tree Automata. Rémi Gilleron, Sophie Tison, Marc Tommasi. STACS 1993, 505-514. Web SearchBibTeXDownload
1992
5For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Sándor Vágvölgyi, Rémi Gilleron. Bulletin of the EATCS (48): 197-209 (1992). Web SearchBibTeX
1991
4Bottom-Up Tree Pushdown Automata and Rewrite Systems. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi. RTA 1991, 287-298. Web SearchBibTeXDownload
3Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. Rémi Gilleron. STACS 1991, 148-159. Web SearchBibTeXDownload
1990
2Proofs and Reachablity Problem for Ground Rewrite Systems. Jean-Luc Coquidé, Rémi Gilleron. IMYCS 1990, 120-129. Web SearchBibTeXDownload
1989
1The Reachability Problem for Ground TRS and Some Extensions. Aline Deruyver, Rémi Gilleron. TAPSOFT, Vol.1 1989, 227-243. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research