Rémi Gilleron - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2023

WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical EntailmentJoseph Renner, Pascal Denis, Rémi Gilleron. emnlp 2023: 9176-9182 [doi]

Exploring Category Structure with Contextual Language Models and Lexical Semantic NetworksJoseph Renner, Pascal Denis, Rémi Gilleron, Angèle Brunellière. eacl 2023: 2269-2282 [doi]

2020

Skill Rating for Multiplayer Games. Introducing Hypernode Graphs and their Spectral TheoryThomas Ricatte, Rémi Gilleron, Marc Tommasi. jmlr, 21, 2020. [doi]

2014

Hypernode Graphs for Spectral Learning on Binary Relations over SetsThomas Ricatte, Rémi Gilleron, Marc Tommasi. pkdd 2014: 662-677 [doi]

2013

Query induction with schema-guided pruning strategiesJoachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron. jmlr, 14(1):927-964, 2013. [doi]

Learning from Multiple Graphs Using a Sigmoid KernelThomas Ricatte, Gemma C. Garriga, Rémi Gilleron, Marc Tommasi. icmla 2013: 140-145 [doi]

2012

Learning Multiple Tasks with Boosted Decision TreesJean Baptiste Faddoul, Boris Chidlovskii, Rémi Gilleron, Fabien Torre. pkdd 2012: 681-696 [doi]

2010

Boosting Multi-Task Weak Learners with Applications to Textual and Social DataJean Baptiste Faddoul, Boris Chidlovskii, Fabien Torre, Rémi Gilleron. icmla 2010: 367-372 [doi]

2009

Retrieving valid matches for XML keyword searchLingbo Kong, Rémi Gilleron, Aurélien Lemay. SAC 2009: 1536-1540 [doi]

Retrieving meaningful relaxed tightest fragments for XML keyword searchLingbo Kong, Rémi Gilleron, Aurélien Lemay. edbt 2009: 815-826 [doi]

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword SearchLingbo Kong, Rémi Gilleron, Aurélien Lemay. dasfaa 2009: 543-548 [doi]

2008

2007

Interactive learning of node selecting tree transducerJulien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren. ml, 66(1):33-67, 2007. [doi]

2006

2005

Learning from positive and unlabeled examplesFrançois Denis, Rémi Gilleron, Fabien Letouzey. TCS, 348(1):70-83, 2005. [doi]

2003

Residual Finite Tree AutomataJulien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi. dlt 2003: 171-182 [doi]

Learning Multi-label Alternating Decision Trees from Texts and DataFrancesco De Comité, Rémi Gilleron, Marc Tommasi. mldm 2003: 35-49 [doi]

2001

PAC Learning under Helpful DistributionsFrançois Denis, Rémi Gilleron. ita, 35(2):129-148, 2001. [doi]

2000

Learning from Positive and Unlabeled ExamplesFabien Letouzey, François Denis, Rémi Gilleron. alt 2000: 71-85 [doi]

1999

Positive and Unlabeled Examples Help LearningFrancesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey. alt 1999: 219-230 [doi]

Set Constraints and AutomataRémi Gilleron, Sophie Tison, Marc Tommasi. iandc, 149(1):1-41, 1999.

1997

PAC Learning under Helpful DistributionsFrançois Denis, Rémi Gilleron. alt 1997: 132-145

1996

PAC Learning with Simple ExamplesFrançois Denis, Cyrille D Halluin, Rémi Gilleron. STACS 1996: 231-242

1995

Regular Tree Languages and Rewrite SystemsRémi Gilleron, Sophie Tison. FUIN, 24(1/2):157-174, 1995.

1994

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite SystemsJean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi. TCS, 127(1):69-98, 1994.

Some new Decidability Results on Positive and Negative Set ConstraintsRémi Gilleron, Sophie Tison, Marc Tommasi. iccl 1994: 336-351

1993

Solving Systems of Set Constraints with Negated Subset RelationshipsRémi Gilleron, Sophie Tison, Marc Tommasi. focs 1993: 372-380

Solving Systems of Set Constraints using Tree AutomataRémi Gilleron, Sophie Tison, Marc Tommasi. STACS 1993: 505-514

1992

For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizableSándor Vágvölgyi, Rémi Gilleron. eatcs, 48:197-209, 1992.

1991

Bottom-Up Tree Pushdown Automata and Rewrite SystemsJean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi. RTA 1991: 287-298

Decision Problems for Term Rewriting Systems and Recognizable Tree LanguagesRémi Gilleron. STACS 1991: 148-159

1990

Proofs and Reachablity Problem for Ground Rewrite SystemsJean-Luc Coquidé, Rémi Gilleron. imycs 1990: 120-129

1989

The Reachability Problem for Ground TRS and Some ExtensionsAline Deruyver, Rémi Gilleron. tapsoft 1989: 227-243

Sign in or sign up to see more results.

runs on WebDSL