default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Denis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j13]Raphaël Bailly, Guillaume Rabusseau, François Denis:
Recognizable series on graphs and hypergraphs. J. Comput. Syst. Sci. 104: 58-81 (2019)- 2016
- [j12]François Denis, Mattias Gybels, Amaury Habrard:
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning. J. Mach. Learn. Res. 17: 31:1-31:32 (2016) - [c30]Denis Arrivault, Dominique Benielli, François Denis, Rémi Eyraud:
Sp2Learn: A Toolbox for the Spectral Learning of Weighted Automata. ICGI 2016: 105-119 - 2015
- [c29]Raphaël Bailly, François Denis, Guillaume Rabusseau:
Recognizable Series on Hypergraphs. LATA 2015: 639-651 - 2014
- [c28]Mattias Gybels, François Denis, Amaury Habrard:
Some improvements of the spectral learning approach for probabilistic grammatical inference. ICGI 2014: 64-78 - [c27]Guillaume Rabusseau, François Denis:
Maximizing a Tree Series in the Representation Space. ICGI 2014: 124-138 - [c26]François Denis, Mattias Gybels, Amaury Habrard:
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning. ICML 2014: 449-457 - [i7]Guillaume Rabusseau, François Denis:
Learning Negative Mixture Models by Tensor Decompositions. CoRR abs/1403.4224 (2014) - [i6]Raphaël Bailly, François Denis, Guillaume Rabusseau:
Recognizable Series on Hypergraphs. CoRR abs/1404.7533 (2014) - 2013
- [i5]François Denis, Mattias Gybels, Amaury Habrard:
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning. CoRR abs/1312.6282 (2013) - 2011
- [j11]Raphaël Bailly, François Denis:
Absolute convergence of rational series is semi-decidable. Inf. Comput. 209(3): 280-295 (2011) - 2010
- [c25]Raphaël Bailly, Amaury Habrard, François Denis:
A Spectral Approach for Probabilistic Grammatical Inference on Trees. ALT 2010: 74-88
2000 – 2009
- 2009
- [c24]Raphaël Bailly, François Denis, Liva Ralaivola:
Grammatical inference as a principal component analysis problem. ICML 2009: 33-40 - [c23]Raphaël Bailly, François Denis:
Absolute Convergence of Rational Series Is Semi-decidable. LATA 2009: 117-128 - 2008
- [j10]François Denis, Yann Esposito:
On Rational Stochastic Languages. Fundam. Informaticae 86(1-2): 41-77 (2008) - [c22]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 - [i4]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) - 2007
- [c21]François Denis, Amaury Habrard:
Learning Rational Stochastic Tree Languages. ALT 2007: 242-256 - [c20]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
- [c19]François Denis, Yann Esposito, Amaury Habrard:
Learning Rational Stochastic Languages. COLT 2006: 274-288 - [c18]Amaury Habrard, François Denis, Yann Esposito:
Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference. ICGI 2006: 112-124 - [c17]François Denis, Christophe Nicolas Magnan, Liva Ralaivola:
Efficient learning of Naive Bayes classifiers under class-conditional classification noise. ICML 2006: 265-272 - [c16]Liva Ralaivola, François Denis, Christophe Nicolas Magnan:
CN = CPCN. ICML 2006: 721-728 - [i3]François Denis, Yann Esposito, Amaury Habrard:
Learning rational stochastic languages. CoRR abs/cs/0602062 (2006) - [i2]François Denis, Yann Esposito:
Rational stochastic languages. CoRR abs/cs/0602093 (2006) - [i1]Amaury Habrard, François Denis, Yann Esposito:
Using Pseudo-Stochastic Rational Languages in Probabilistic Grammatical Inference. CoRR abs/cs/0607085 (2006) - 2005
- [j9]Pierre Dupont, François Denis, Yann Esposito:
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. Pattern Recognit. 38(9): 1349-1371 (2005) - [j8]François Denis, Rémi Gilleron, Fabien Letouzey:
Learning from positive and unlabeled examples. Theor. Comput. Sci. 348(1): 70-83 (2005) - [e1]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 [contents] - 2004
- [j7]François Denis, Aurélien Lemay, Alain Terlutte:
Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004) - [c15]François Denis, Yann Esposito:
Learning Classes of Probabilistic Automata. COLT 2004: 124-139 - 2003
- [j6]François Denis, Olivier Gascuel:
On the consistency of the minimum evolution principle of phylogenetic inference. Discret. Appl. Math. 127(1): 63-77 (2003) - [c14]François Denis, Yann Esposito:
Residual Languages and Probabilistic Automata. ICALP 2003: 452-463 - 2002
- [j5]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. Fundam. Informaticae 51(4): 339-368 (2002) - [c13]François Denis, Aurélien Lemay, Alain Terlutte:
Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76 - [c12]Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont:
Learning Probabilistic Residual Finite State Automata. ICGI 2002: 77-91 - 2001
- [j4]François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. RAIRO Theor. Informatics Appl. 35(2): 129-148 (2001) - [j3]François Denis:
Learning Regular Languages from Simple Positive Examples. Mach. Learn. 44(1/2): 37-66 (2001) - [c11]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using RFSA. ALT 2001: 348-363 - [c10]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. STACS 2001: 144-157 - 2000
- [c9]Fabien Letouzey, François Denis, Rémi Gilleron:
Learning from Positive and Unlabeled Examples. ALT 2000: 71-85 - [c8]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50
1990 – 1999
- 1999
- [j2]François Denis:
Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete. Inf. Process. Lett. 69(1): 1-5 (1999) - [c7]Francesco De Comité, François Denis, Rémi Gilleron, Fabien Letouzey:
Positive and Unlabeled Examples Help Learning. ALT 1999: 219-230 - 1998
- [c6]François Denis:
PAC Learning from Positive Statistical Queries. ALT 1998: 112-126 - 1997
- [c5]François Denis, Rémi Gilleron:
PAC Learning under Helpful Distributions. ALT 1997: 132-145 - 1996
- [c4]François Denis, Cyrille D'Halluin, Rémi Gilleron:
PAC Learning with Simple Examples. STACS 1996: 231-242 - 1991
- [j1]François Denis, Jean-Paul Delahaye:
Is there an Axiomatic Semantics for Standard Pure Prolog. Theor. Comput. Sci. 82(2): 373-388 (1991) - [c3]François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. JTASPEFT/WSA 1991: 157-164 - [c2]François Denis, Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. STACS 1991: 511-522 - 1990
- [c1]Jean-Paul Delahaye, François Denis:
Operational semantics of Standard Prolog: an axiomatic approach. SPLT 1990: 311-
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
