( en | de | ru )

 

Disambiguation of "Gilleron, Rémi"

Author of the publication

copydeleteadd this publication to your clipboard
PAC learning with simple examples

, , and . STACS 96, page 231--242. Berlin, Heidelberg, Springer Berlin Heidelberg, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rolf Rémi

Rémi Auguste

Rémi Revire

Rémi Dorat

Rémi Flamary

 

Other publications of authors with the same name

Learning from Multiple Graphs Using a Sigmoid Kernel., , , and . ICMLA (2), page 140-145. IEEE, (2013)978-0-7695-5144-9.The Reachability Problem for Ground TRS and Some Extensions., and . TAPSOFT, Vol.1, volume 351 of Lecture Notes in Computer Science, page 227-243. Springer, (1989)Some new Decidability Results on Positive and Negative Set Constraints., , and . CCL, volume 845 of Lecture Notes in Computer Science, page 336-351. Springer, (1994)WordNet Is All You Need: A Surprisingly Effective Unsupervised Method for Graded Lexical Entailment., , and . EMNLP (Findings), page 9176-9182. Association for Computational Linguistics, (2023)PAC Learning under Helpful Distributions., and . ALT, volume 1316 of Lecture Notes in Computer Science, page 132-145. Springer, (1997)Learning Multi-label Alternating Decision Trees from Texts and Data., , and . MLDM, volume 2734 of Lecture Notes in Computer Science, page 35-49. Springer, (2003)Retrieving meaningful relaxed tightest fragments for XML keyword search., , and . EDBT, volume 360 of ACM International Conference Proceeding Series, page 815-826. ACM, (2009)Regular Tree Languages and Rewrite Systems., and . Fundam. Informaticae, 24 (1/2): 157-174 (1995)Solving Systems of Set Constraints using Tree Automata., , and . STACS, volume 665 of Lecture Notes in Computer Science, page 505-514. Springer, (1993)Learning Multiple Tasks with Boosted Decision Trees., , , and . ECML/PKDD (1), volume 7523 of Lecture Notes in Computer Science, page 681-696. Springer, (2012)