default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Campillo
Person information
- affiliation: INRIA/INRA, UMR MISTEA, Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j11]Samuel Nyobe, Fabien Campillo
, Serge Moto, Vivien Rossi:
The one step fixed-lag particle smoother as a strategy to improve the prediction step of particle filtering. ARIMA J. 39 (2023)- 2019
- [j10]Fabien Campillo, Mohsen Chebbi, Salwa Toumi:
Stochastic modeling for biotechnologies Anaerobic model AM2b [Modélisation stochastique pour les biotechnologies : modèle anaérobie AM2b]. ARIMA J. 28 (2019) - 2018
- [j9]Fabien Campillo, Marc Joannides, Irène Larramendy-Valverde:
Parameter identification for a stochastic logistic growth model with extinction. Commun. Stat. Simul. Comput. 47(3): 721-737 (2018) - 2014
- [j8]Fabien Campillo, Dominique Hervé, Angelo Raherinirina, Rivo Rakotozafy:
Markov analysis of land use dynamics - A Case Study in Madagascar. ARIMA J. 17 (2014) - [j7]Fabien Campillo, Marc Joannides, Irène Larramendy-Valverde:
Approximation of the Fokker-Planck equation of the stochastic chemostat. Math. Comput. Simul. 99: 37-53 (2014) - 2009
- [j6]Fabien Campillo, Rivo Rakotozafy, Vivien Rossi:
Parallel and interacting Markov chain Monte Carlo algorithm. Math. Comput. Simul. 79(12): 3424-3433 (2009) - 2008
- [j5]Fabien Campillo, Philippe Cantet, Rivo Rakotozafy, Vivien Rossi:
Méthodes MCMC en interaction pour l'évaluation de ressources naturelles. ARIMA J. 8: 4 (2008) - [j4]Fabien Campillo, Rivo Rakotozafy, Vivien Rossi:
Computational probability modeling and Bayesian inference. ARIMA J. 9: 8 (2008) - [j3]Cédric Gaucherel, Fabien Campillo, Laurent Misson, Joel Guiot, Jean-Jacques Boreux:
Parameterization of a process-based tree-growth model: Comparison of optimization, MCMC and Particle Filtering algorithms. Environ. Model. Softw. 23(10-11): 1280-1288 (2008) - 2002
- [j2]Fabien Campillo, Antoine Lejay:
A Monte Carlo method without grid for a fractured porous domain model. Monte Carlo Methods Appl. 8(2): 129-148 (2002) - 2001
- [j1]Fabien Campillo, Antoine Lejay:
A Monte Carlo method to compute the exchange coefficient in the double porosity model. Monte Carlo Methods Appl. 7(1-2): 65-72 (2001)
Conference and Workshop Papers
- 2006
- [c3]Fabien Campillo, Vivien Rossi:
Convolution particle filtering for parameter estimation in general state-space models. CDC 2006: 2159-2164 - 2005
- [c2]Qinghua Zhang, Fabien Campillo, Frédéric Cérou, François Le Gland:
Nonlinear system fault detection and isolation based on bootstrap particle filters. CDC/ECC 2005: 3821-3826 - [c1]Fabien Campillo, Laurent Mevel:
Recursive maximum likelihood estimation for structural health monitoring: tangent filter implementations. CDC/ECC 2005: 5923-5928
Informal and Other Publications
- 2023
- [i2]Fabien Campillo:
The Gauss-Galerkin approximation method in nonlinear filtering. CoRR abs/2303.15448 (2023) - 2019
- [i1]Benjamin Aymard, Fabien Campillo, Romain Veltz:
Mean-field limit of interacting 2D nonlinear stochastic spiking neurons. CoRR abs/1906.10232 (2019)
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 2025-01-09 13:21 CET 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:
