default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémi Gilleron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c29]Joseph Renner, Pascal Denis, Rémi Gilleron, Angèle Brunellière:
Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks. EACL 2023: 2269-2282- [c28]Joseph Renner, Pascal Denis, Rémi Gilleron:
WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment. EMNLP (Findings) 2023: 9176-9182 - [i4]Joseph Renner, Pascal Denis, Rémi Gilleron, Angèle Brunellière:
Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks. CoRR abs/2302.06942 (2023) - 2020
- [j10]Thomas Ricatte, Rémi Gilleron, Marc Tommasi:
Skill Rating for Multiplayer Games. Introducing Hypernode Graphs and their Spectral Theory. J. Mach. Learn. Res. 21: 48:1-48:18 (2020) - [p2]Olivier Bournez
, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computability, Decidability and Logic. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 1-50 - [p1]Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison:
Theoretical Computer Science: Computational Complexity. A Guided Tour of Artificial Intelligence Research (3) (III) 2020: 51-89
2010 – 2019
- 2014
- [c27]Thomas Ricatte, Rémi Gilleron, Marc Tommasi:
Hypernode Graphs for Spectral Learning on Binary Relations over Sets. ECML/PKDD (2) 2014: 662-677 - 2013
- [j9]Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron:
Query induction with schema-guided pruning strategies. J. Mach. Learn. Res. 14(1): 927-964 (2013) - [c26]Thomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi:
Learning from Multiple Graphs Using a Sigmoid Kernel. ICMLA (2) 2013: 140-145 - 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
2000 – 2009
- 2009
- [j8]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
- [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 - [i3]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) - [i2]Pierre Senellart, Serge Abiteboul, Rémi Gilleron:
Understanding the Hidden Web. ERCIM News 2008(72) (2008) - 2007
- [j7]Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Interactive learning of node selecting tree transducer. Mach. Learn. 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]François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. RAIRO Theor. Informatics Appl. 35(2): 129-148 (2001) - 2000
- [c11]Fabien Letouzey, François Denis, Rémi Gilleron:
Learning from Positive and Unlabeled Examples. ALT 2000: 71-85
1990 – 1999
- 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]François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. ALT 1997: 132-145 - 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. Informaticae 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. Bull. 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
1980 – 1989
- 1989
- [c1]Aline Deruyver, Rémi Gilleron:
The Reachability Problem for Ground TRS and Some Extensions. TAPSOFT, Vol.1 1989: 227-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
