The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

François Denis: [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
    PAC Learning from Positive Statistical Queries. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:112-126 [Conf]
  3. François Denis, Rémi Gilleron
    PAC Learning under Helpful Distributions. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:132-145 [Conf]
  4. François Denis, Aurélien Lemay, Alain Terlutte
    Learning Regular Languages Using RFSA. [Citation Graph (0, 0)][DBLP]
    ALT, 2001, pp:348-363 [Conf]
  5. 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]
  6. François Denis, Yann Esposito
    Learning Classes of Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:124-139 [Conf]
  7. François Denis, Yann Esposito, Amaury Habrard
    Learning Rational Stochastic Languages. [Citation Graph (0, 0)][DBLP]
    COLT, 2006, pp:274-288 [Conf]
  8. François Denis, Yann Esposito
    Residual Languages and Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:452-463 [Conf]
  9. Amaury Habrard, François Denis, Yann Esposito
    Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference. [Citation Graph (0, 0)][DBLP]
    ICGI, 2006, pp:112-124 [Conf]
  10. François Denis, Aurélien Lemay, Alain Terlutte
    Learning Regular Languages Using Non Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2000, pp:39-50 [Conf]
  11. François Denis, Aurélien Lemay, Alain Terlutte
    Some Classes of Regular Languages Identifiable in the Limit from Positive Data. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:63-76 [Conf]
  12. Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont
    Learning Probabilistic Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
    ICGI, 2002, pp:77-91 [Conf]
  13. François Denis, Christophe Nicolas Magnan, Liva Ralaivola
    Efficient learning of Naive Bayes classifiers under class-conditional classification noise. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:265-272 [Conf]
  14. Liva Ralaivola, François Denis, Christophe Nicolas Magnan
    CN = CPCN. [Citation Graph (0, 0)][DBLP]
    ICML, 2006, pp:721-728 [Conf]
  15. Jean-Paul Delahaye, François Denis
    Operational semantics of Standard Prolog: an axiomatic approach. [Citation Graph (0, 0)][DBLP]
    SPLT, 1990, pp:311-0 [Conf]
  16. François Denis, Jean-Paul Delahaye
    Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:157-164 [Conf]
  17. François Denis, Jean-Paul Delahaye
    Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:511-522 [Conf]
  18. 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]
  19. François Denis, Aurélien Lemay, Alain Terlutte
    Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:144-157 [Conf]
  20. François Denis, Olivier Gascuel
    On the consistency of the minimum evolution principle of phylogenetic inference. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:1, pp:63-77 [Journal]
  21. François Denis, Aurélien Lemay, Alain Terlutte
    Residual Finite State Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:51, n:4, pp:339-368 [Journal]
  22. François Denis
    Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:1, pp:1-5 [Journal]
  23. 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]
  24. François Denis
    Learning Regular Languages from Simple Positive Examples. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:37-66 [Journal]
  25. Pierre Dupont, François Denis, Yann Esposito
    Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2005, v:38, n:9, pp:1349-1371 [Journal]
  26. François Denis, Jean-Paul Delahaye
    Is there an Axiomatic Semantics for Standard Pure Prolog. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:2, pp:373-388 [Journal]
  27. 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]
  28. François Denis, Aurélien Lemay, Alain Terlutte
    Learning regular languages using RFSAs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:2, pp:267-294 [Journal]
  29. François Denis, Amaury Habrard
    Learning Rational Stochastic Tree Languages. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:242-256 [Conf]
  30. François Denis, Yann Esposito, Amaury Habrard
    Learning rational stochastic languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  31. François Denis, Yann Esposito
    Rational stochastic languages [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  32. Amaury Habrard, François Denis, Yann Esposito
    Using Pseudo-Stochastic Rational Languages in Probabilistic Grammatical Inference [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  33. A Spectral Approach for Probabilistic Grammatical Inference on Trees. [Citation Graph (, )][DBLP]


  34. Relevant Representations for the Inference of Rational Stochastic Tree Languages. [Citation Graph (, )][DBLP]


  35. Grammatical inference as a principal component analysis problem. [Citation Graph (, )][DBLP]


  36. A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions. [Citation Graph (, )][DBLP]


  37. Absolute Convergence of Rational Series Is Semi-decidable. [Citation Graph (, )][DBLP]


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


Search in 0.017secs, Finished in 0.019secs
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