François Denis

According to our database, François Denis authored at least 39 papers between 1990 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Recognizable series on graphs and hypergraphs.

Raphaël Bailly, Guillaume Rabusseau, François Denis

J. Comput. Syst. Sci., 2019

2016

Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning.

François Denis, Mattias Gybels, Amaury Habrard

J. Mach. Learn. Res., 2016

Sp2Learn: A Toolbox for the Spectral Learning of Weighted Automata.

Denis Arrivault, Dominique Benielli, François Denis, Rémi Eyraud

Proceedings of the 13th International Conference on Grammatical Inference, 2016

2015

Recognizable Series on Hypergraphs.

Raphaël Bailly, François Denis, Guillaume Rabusseau

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Learning Negative Mixture Models by Tensor Decompositions.

Guillaume Rabusseau, François Denis

CoRR, 2014

Maximizing a Tree Series in the Representation Space.

Guillaume Rabusseau, François Denis

Proceedings of the 12th International Conference on Grammatical Inference, 2014

Some improvements of the spectral learning approach for probabilistic grammatical inference.

Mattias Gybels, François Denis, Amaury Habrard

Proceedings of the 12th International Conference on Grammatical Inference, 2014

2011

Absolute convergence of rational series is semi-decidable.

Raphaël Bailly, François Denis

Inf. Comput., 2011

2010

A Spectral Approach for Probabilistic Grammatical Inference on Trees.

Raphaël Bailly, Amaury Habrard, François Denis

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Grammatical inference as a principal component analysis problem.

Raphaël Bailly, François Denis, Liva Ralaivola

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

2008

On Rational Stochastic Languages.

François Denis, Yann Esposito

Fundam. Informaticae, 2008

On Probability Distributions for Trees: Representations, Inference and Learning

François Denis, Amaury Habrard, Rémi Gilleron, Marc Tommasi, Édouard Gilbert

CoRR, 2008

Relevant Representations for the Inference of Rational Stochastic Tree Languages.

François Denis, Édouard Gilbert, Amaury Habrard, Faissal Ouardi, Marc Tommasi

Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007

A Protocol to Detect Local Affinities Involved in Proteins Distant Interactions.

Christophe Nicolas Magnan, Cécile Capponi, François Denis

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2007

Learning Rational Stochastic Tree Languages.

François Denis, Amaury Habrard

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006

CN = CPCN.

Liva Ralaivola, François Denis, Christophe Nicolas Magnan

Proceedings of the Machine Learning, 2006

Efficient learning of Naive Bayes classifiers under class-conditional classification noise.

François Denis, Christophe Nicolas Magnan, Liva Ralaivola

Proceedings of the Machine Learning, 2006

Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference.

Amaury Habrard, François Denis, Yann Esposito

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

Learning Rational Stochastic Languages.

François Denis, Yann Esposito, Amaury Habrard

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Learning from positive and unlabeled examples.

François Denis, Rémi Gilleron, Fabien Letouzey

Theor. Comput. Sci., 2005

Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms.

Pierre Dupont, François Denis, Yann Esposito

Pattern Recognit., 2005

2004

Learning regular languages using RFSAs.

François Denis, Aurélien Lemay, Alain Terlutte

Theor. Comput. Sci., 2004

Learning Classes of Probabilistic Automata.

François Denis, Yann Esposito

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

On the consistency of the minimum evolution principle of phylogenetic inference.

François Denis, Olivier Gascuel

Discret. Appl. Math., 2003

Residual Languages and Probabilistic Automata.

François Denis, Yann Esposito

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Residual Finite State Automata.

François Denis, Aurélien Lemay, Alain Terlutte

Fundam. Informaticae, 2002

Learning Probabilistic Residual Finite State Automata.

Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Some Classes of Regular Languages Identifiable in the Limit from Positive Data.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Learning Regular Languages from Simple Positive Examples.

François Denis

Mach. Learn., 2001

PAC Learning under Helpful Distributions.

François Denis, Rémi Gilleron

RAIRO Theor. Informatics Appl., 2001

Learning Regular Languages Using RFSA.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000

Learning Regular Languages Using Non Deterministic Finite Automata.

François Denis, Aurélien Lemay, Alain Terlutte

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999

Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete.

François Denis

Inf. Process. Lett., 1999

Positive and Unlabeled Examples Help Learning.

Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

PAC Learning from Positive Statistical Queries.

François Denis

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1996

PAC Learning with Simple Examples.

François Denis, Cyrille D'Halluin, Rémi Gilleron

Proceedings of the STACS 96, 1996

1991

Is there an Axiomatic Semantics for Standard Pure Prolog.

François Denis, Jean-Paul Delahaye

Theor. Comput. Sci., 1991

Unfolding, Procedural and Fixpoint Semantics of Logic Programs.

François Denis, Jean-Paul Delahaye

Proceedings of the Actes JTASPEFL'91 (Bordeaux, 1991

1990

Operational semantics of Standard Prolog: an axiomatic approach.

Jean-Paul Delahaye, François Denis

Proceedings of the SPLT'90, 1990