The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rémi Gilleron: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey
    Positive and Unlabeled Examples Help Learning. [Citation Graph (0, 0)][DBLP]
    ATL, 1999, pp:219-230 [Conf]
  2. François Denis, Rémi Gilleron
    PAC Learning under Helpful Distributions. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:132-145 [Conf]
  3. Fabien Letouzey, François Denis, Rémi Gilleron
    Learning from Positive and Unlabeled Examples. [Citation Graph (0, 0)][DBLP]
    ALT, 2000, pp:71-85 [Conf]
  4. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Some new Decidability Results on Positive and Negative Set Constraints. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:336-351 [Conf]
  5. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
    Residual Finite Tree Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:171-182 [Conf]
  6. Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre
    Extraction de relations dans les documents Web. [Citation Graph (0, 0)][DBLP]
    EGC, 2006, pp:415-420 [Conf]
  7. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Solving Systems of Set Constraints with Negated Subset Relationships [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:372-380 [Conf]
  8. Aurélien Lemay, Joachim Niehren, Rémi Gilleron
    Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:253-267 [Conf]
  9. Jean-Luc Coquidé, Rémi Gilleron
    Proofs and Reachablity Problem for Ground Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:120-129 [Conf]
  10. Francesco De Comité, Rémi Gilleron, Marc Tommasi
    Learning Multi-label Alternating Decision Trees from Texts and Data. [Citation Graph (0, 0)][DBLP]
    MLDM, 2003, pp:35-49 [Conf]
  11. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
    Bottom-Up Tree Pushdown Automata and Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1991, pp:287-298 [Conf]
  12. François Denis, Cyrille D'Halluin, Rémi Gilleron
    PAC Learning with Simple Examples. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:231-242 [Conf]
  13. Rémi Gilleron
    Decision Problems for Term Rewriting Systems and Recognizable Tree Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:148-159 [Conf]
  14. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Solving Systems of Set Constraints using Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:505-514 [Conf]
  15. Aline Deruyver, Rémi Gilleron
    The Reachability Problem for Ground TRS and Some Extensions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:227-243 [Conf]
  16. Rémi Gilleron, Patrick Marty, Marc Tommasi, Fabien Torre
    Interactive Tuples Extraction from Semi-Structured Data. [Citation Graph (0, 0)][DBLP]
    Web Intelligence, 2006, pp:997-1004 [Conf]
  17. Sándor Vágvölgyi, Rémi Gilleron
    For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1992, v:48, n:, pp:197-209 [Journal]
  18. Rémi Gilleron, Sophie Tison
    Regular Tree Languages and Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:24, n:1/2, pp:157-174 [Journal]
  19. Rémi Gilleron, Sophie Tison, Marc Tommasi
    Set Constraints and Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:149, n:1, pp:1-41 [Journal]
  20. François Denis, Rémi Gilleron
    PAC Learning under Helpful Distributions. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:2, pp:129-148 [Journal]
  21. Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
    Interactive learning of node selecting tree transducer. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2007, v:66, n:1, pp:33-67 [Journal]
  22. Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi
    Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:69-98 [Journal]
  23. François Denis, Rémi Gilleron, Fabien Letouzey
    Learning from positive and unlabeled examples. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:1, pp:70-83 [Journal]
  24. Rémi Gilleron, Florent Jousse, Isabelle Tellier, Marc Tommasi
    XML Document Transformation with Conditional Random Fields. [Citation Graph (0, 0)][DBLP]
    INEX, 2006, pp:525-539 [Conf]
  25. Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
    Residual Finite Tree Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  26. ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. [Citation Graph (, )][DBLP]


  27. Retrieving meaningful relaxed tightest fragments for XML keyword search. [Citation Graph (, )][DBLP]


  28. Schema-Guided Induction of Monadic Queries. [Citation Graph (, )][DBLP]


  29. Retrieving valid matches for XML keyword search. [Citation Graph (, )][DBLP]


  30. Automatic wrapper induction from hidden-web sources with domain knowledge. [Citation Graph (, )][DBLP]


  31. Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. [Citation Graph (, )][DBLP]


  32. On Probability Distributions for Trees: Representations, Inference and Learning [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002