dblp.uni-trier.dewww.uni-trier.de

François Denis Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
39EERaphaël Bailly, François Denis, Liva Ralaivola: Grammatical inference as a principal component analysis problem. ICML 2009: 5
38EERaphaël Bailly, François Denis: Absolute Convergence of Rational Series Is Semi-decidable. LATA 2009: 117-128
2008
37EEFrançois Denis, Édouard Gilbert, Amaury Habrard, Faissal Ouardi, Marc Tommasi: Relevant Representations for the Inference of Rational Stochastic Tree Languages. ICGI 2008: 57-70
36EEFranç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)
35EEFrançois Denis, Yann Esposito: On Rational Stochastic Languages. Fundam. Inform. 86(1-2): 41-77 (2008)
2007
34EEFrançois Denis, Amaury Habrard: Learning Rational Stochastic Tree Languages. ALT 2007: 242-256
33EEChristophe Nicolas Magnan, Cécile Capponi, François Denis: A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions. BIBM 2007: 252-257
2006
32EEFrançois Denis, Yann Esposito, Amaury Habrard: Learning Rational Stochastic Languages. COLT 2006: 274-288
31EEAmaury Habrard, François Denis, Yann Esposito: Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference. ICGI 2006: 112-124
30EEFrançois Denis, Christophe Nicolas Magnan, Liva Ralaivola: Efficient learning of Naive Bayes classifiers under class-conditional classification noise. ICML 2006: 265-272
29EELiva Ralaivola, François Denis, Christophe Nicolas Magnan: CN = CPCN. ICML 2006: 721-728
28EEFrançois Denis, Yann Esposito, Amaury Habrard: Learning rational stochastic languages CoRR abs/cs/0602062: (2006)
27EEFrançois Denis, Yann Esposito: Rational stochastic languages CoRR abs/cs/0602093: (2006)
26EEAmaury 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
24EEPierre 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)
23EEFrançois Denis, Rémi Gilleron, Fabien Letouzey: Learning from positive and unlabeled examples. Theor. Comput. Sci. 348(1): 70-83 (2005)
2004
22EEFrançois Denis, Yann Esposito: Learning Classes of Probabilistic Automata. COLT 2004: 124-139
21EEFrançois Denis, Aurélien Lemay, Alain Terlutte: Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004)
2003
20EEFranç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
18EEFrançois Denis, Aurélien Lemay, Alain Terlutte: Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76
17EEYann Esposito, Aurélien Lemay, François Denis, Pierre Dupont: Learning Probabilistic Residual Finite State Automata. ICGI 2002: 77-91
16EEFrançois Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. Fundam. Inform. 51(4): 339-368 (2002)
2001
15EEFrançois Denis, Aurélien Lemay, Alain Terlutte: Learning Regular Languages Using RFSA. ALT 2001: 348-363
14EEFrançois Denis, Aurélien Lemay, Alain Terlutte: Residual Finite State Automata. STACS 2001: 144-157
13EEFranç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
11EEFabien 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
9EEFrancesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey: Positive and Unlabeled Examples Help Learning. ATL 1999: 219-230
8EEFrançois Denis: Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. Inf. Process. Lett. 69(1): 1-5 (1999)
1998
7EEFranç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
5EEFranç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
3EEFranç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-

Coauthor Index

1Raphaël Bailly [38] [39]
2Cécile Capponi [33]
3Francesco De Comité [9]
4Cyrille D'Halluin [5]
5Jean-Paul Delahaye [1] [2] [3] [4]
6Pierre Dupont [17] [24]
7Yann Esposito [17] [20] [22] [24] [26] [27] [28] [31] [32] [35]
8Olivier Gascuel [19]
9Édouard Gilbert [36] [37]
10Rémi Gilleron [5] [6] [9] [11] [13] [23] [36]
11Amaury Habrard [26] [28] [31] [32] [34] [36] [37]
12Aurélien Lemay [10] [14] [15] [16] [17] [18] [21]
13Fabien Letouzey [9] [11] [23]
14Christophe Nicolas Magnan [29] [30] [33]
15Faissal Ouardi [37]
16Liva Ralaivola [29] [30] [39]
17Alain Terlutte [10] [14] [15] [16] [18] [21]
18Marc Tommasi [36] [37]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)