Rémi Gilleron

According to our database1, Rémi Gilleron authored at least 39 papers between 1989 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

Exploring Category Structure with Contextual Language Models and Lexical Semantic Networks.
Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics, 2023

2020
Skill Rating for Multiplayer Games. Introducing Hypernode Graphs and their Spectral Theory.
J. Mach. Learn. Res., 2020

2014
Hypernode Graphs for Spectral Learning on Binary Relations over Sets.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

2013
Query induction with schema-guided pruning strategies.
J. Mach. Learn. Res., 2013

Learning from Multiple Graphs Using a Sigmoid Kernel.
Proceedings of the 12th International Conference on Machine Learning and Applications, 2013

2012
Learning Multiple Tasks with Boosted Decision Trees.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

2010
Boosting Multi-Task Weak Learners with Applications to Textual and Social Data.
Proceedings of the Ninth International Conference on Machine Learning and Applications, 2010

2009
Efficient inclusion checking for deterministic tree automata and XML Schemas.
Inf. Comput., 2009

Retrieving valid matches for XML keyword search.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Retrieving meaningful relaxed tightest fragments for XML keyword search.
Proceedings of the EDBT 2009, 2009

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.
Proceedings of the Database Systems for Advanced Applications, 2009

2008
Understanding the Hidden Web.
ERCIM News, 2008

On Probability Distributions for Trees: Representations, Inference and Learning
CoRR, 2008

Automatic wrapper induction from hidden-web sources with domain knowledge.
Proceedings of the 10th ACM International Workshop on Web Information and Data Management (WIDM 2008), 2008

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
Proceedings of the Language and Automata Theory and Applications, 2008

Schema-Guided Induction of Monadic Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
Interactive learning of node selecting tree transducer.
Mach. Learn., 2007

2006
Interactive Tuples Extraction from Semi-Structured Data.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

XML Document Transformation with Conditional Random Fields.
Proceedings of the Comparative Evaluation of XML Information Retrieval Systems, 2006

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

Extraction de relations dans les documents Web.
Proceedings of the Extraction et gestion des connaissances (EGC'2006), 2006

2005
Learning from positive and unlabeled examples.
Theor. Comput. Sci., 2005

2003
Learning Multi-label Alternating Decision Trees from Texts and Data.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2003

Residual Finite Tree Automata.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2001
PAC Learning under Helpful Distributions.
RAIRO Theor. Informatics Appl., 2001

1999
Set Constraints and Automata.
Inf. Comput., 1999

Positive and Unlabeled Examples Help Learning.
Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1996
PAC Learning with Simple Examples.
Proceedings of the STACS 96, 1996

1995
Regular Tree Languages and Rewrite Systems.
Fundam. Informaticae, 1995

1994
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci., 1994

Some new Decidability Results on Positive and Negative Set Constraints.
Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993
Solving Systems of Set Constraints using Tree Automata.
Proceedings of the STACS 93, 1993

Solving Systems of Set Constraints with Negated Subset Relationships
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
Bull. EATCS, 1992

1991
Decision Problems for Term Rewriting Systems and Recognizable Tree Languages.
Proceedings of the STACS 91, 1991

Bottom-Up Tree Pushdown Automata and Rewrite Systems.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1990
Proofs and Reachablity Problem for Ground Rewrite Systems.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989
The Reachability Problem for Ground TRS and Some Extensions.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989


  Loading...