2009 |
38 | EE | Raphaël Bailly,
François Denis:
Absolute Convergence of Rational Series Is Semi-decidable.
LATA 2009: 117-128 |
2008 |
37 | EE | François Denis,
Édouard Gilbert,
Amaury Habrard,
Faissal Ouardi,
Marc Tommasi:
Relevant Representations for the Inference of Rational Stochastic Tree Languages.
ICGI 2008: 57-70 |
36 | EE | François Denis,
Amaury Habrard,
Rémi Gilleron,
Marc Tommasi,
Édouard Gilbert:
On Probability Distributions for Trees: Representations, Inference and Learning
CoRR abs/0807.2983: (2008) |
35 | EE | François Denis,
Yann Esposito:
On Rational Stochastic Languages.
Fundam. Inform. 86(1-2): 41-77 (2008) |
2007 |
34 | EE | François Denis,
Amaury Habrard:
Learning Rational Stochastic Tree Languages.
ALT 2007: 242-256 |
33 | EE | Christophe Nicolas Magnan,
Cécile Capponi,
François Denis:
A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions.
BIBM 2007: 252-257 |
2006 |
32 | EE | François Denis,
Yann Esposito,
Amaury Habrard:
Learning Rational Stochastic Languages.
COLT 2006: 274-288 |
31 | EE | Amaury Habrard,
François Denis,
Yann Esposito:
Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference.
ICGI 2006: 112-124 |
30 | EE | François Denis,
Christophe Nicolas Magnan,
Liva Ralaivola:
Efficient learning of Naive Bayes classifiers under class-conditional classification noise.
ICML 2006: 265-272 |
29 | EE | Liva Ralaivola,
François Denis,
Christophe Nicolas Magnan:
CN = CPCN.
ICML 2006: 721-728 |
28 | EE | François Denis,
Yann Esposito,
Amaury Habrard:
Learning rational stochastic languages
CoRR abs/cs/0602062: (2006) |
27 | EE | François Denis,
Yann Esposito:
Rational stochastic languages
CoRR abs/cs/0602093: (2006) |
26 | EE | Amaury Habrard,
François Denis,
Yann Esposito:
Using Pseudo-Stochastic Rational Languages in Probabilistic Grammatical Inference
CoRR abs/cs/0607085: (2006) |
2005 |
25 | | François Denis:
Actes de CAP 05, Conférence francophone sur l'apprentissage automatique - 2005, Nice, France, du 31 mai au 3 juin 2005
PUG 2005 |
24 | EE | Pierre Dupont,
François Denis,
Yann Esposito:
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms.
Pattern Recognition 38(9): 1349-1371 (2005) |
23 | EE | François Denis,
Rémi Gilleron,
Fabien Letouzey:
Learning from positive and unlabeled examples.
Theor. Comput. Sci. 348(1): 70-83 (2005) |
2004 |
22 | EE | François Denis,
Yann Esposito:
Learning Classes of Probabilistic Automata.
COLT 2004: 124-139 |
21 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning regular languages using RFSAs.
Theor. Comput. Sci. 313(2): 267-294 (2004) |
2003 |
20 | EE | François Denis,
Yann Esposito:
Residual Languages and Probabilistic Automata.
ICALP 2003: 452-463 |
19 | | François Denis,
Olivier Gascuel:
On the consistency of the minimum evolution principle of phylogenetic inference.
Discrete Applied Mathematics 127(1): 63-77 (2003) |
2002 |
18 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Some Classes of Regular Languages Identifiable in the Limit from Positive Data.
ICGI 2002: 63-76 |
17 | EE | Yann Esposito,
Aurélien Lemay,
François Denis,
Pierre Dupont:
Learning Probabilistic Residual Finite State Automata.
ICGI 2002: 77-91 |
16 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Residual Finite State Automata.
Fundam. Inform. 51(4): 339-368 (2002) |
2001 |
15 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning Regular Languages Using RFSA.
ALT 2001: 348-363 |
14 | EE | François Denis,
Aurélien Lemay,
Alain Terlutte:
Residual Finite State Automata.
STACS 2001: 144-157 |
13 | EE | François Denis,
Rémi Gilleron:
PAC Learning under Helpful Distributions.
ITA 35(2): 129-148 (2001) |
12 | | François Denis:
Learning Regular Languages from Simple Positive Examples.
Machine Learning 44(1/2): 37-66 (2001) |
2000 |
11 | EE | Fabien Letouzey,
François Denis,
Rémi Gilleron:
Learning from Positive and Unlabeled Examples.
ALT 2000: 71-85 |
10 | | François Denis,
Aurélien Lemay,
Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata.
ICGI 2000: 39-50 |
1999 |
9 | EE | Francesco De Comité,
François Denis,
Rémi Gilleron,
Fabien Letouzey:
Positive and Unlabeled Examples Help Learning.
ATL 1999: 219-230 |
8 | EE | François Denis:
Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete.
Inf. Process. Lett. 69(1): 1-5 (1999) |
1998 |
7 | EE | François Denis:
PAC Learning from Positive Statistical Queries.
ALT 1998: 112-126 |
1997 |
6 | | François Denis,
Rémi Gilleron:
PAC Learning under Helpful Distributions.
ALT 1997: 132-145 |
1996 |
5 | | François Denis,
Cyrille D'Halluin,
Rémi Gilleron:
PAC Learning with Simple Examples.
STACS 1996: 231-242 |
1991 |
4 | | François Denis,
Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
JTASPEFT/WSA 1991: 157-164 |
3 | | François Denis,
Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
STACS 1991: 511-522 |
2 | | François Denis,
Jean-Paul Delahaye:
Is there an Axiomatic Semantics for Standard Pure Prolog.
Theor. Comput. Sci. 82(2): 373-388 (1991) |
1990 |
1 | | Jean-Paul Delahaye,
François Denis:
Operational semantics of Standard Prolog: an axiomatic approach.
SPLT 1990: 311- |