default search action
Guillaume Perrin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j16]Cécile Haberstich, Anthony Nouy, Guillaume Perrin:
Active Learning of Tree Tensor Networks using Optimal Least Squares. SIAM/ASA J. Uncertain. Quantification 11(3): 848-876 (2023) - [c8]Marine Dumon, Bérengère Lebental
, Guillaume Perrin:
A Calibration Process for Environmental Sensor Array Supporting Uncertainties and Unknown Perturbing Factors: Performances on Simulated and Real Data. SENSORS 2023: 1-4 - 2022
- [j15]Jhouben Cuesta-Ramirez
A comparison of mixed-variables Bayesian optimization approaches. Adv. Model. Simul. Eng. Sci. 9(1): 6 (2022) - [j14]Cécile Haberstich, Anthony Nouy, Guillaume Perrin
Boosted optimal weighted least-squares. Math. Comput. 91(335): 1281-1315 (2022) - [c7]Bérengère Lebental
Water and air quality monitoring with multiparameter chemical sensors Managing non-idealities from lab to field. IEEE SENSORS 2022: 1-4 - [c6]Bérengère Lebental
Uncertainty-based performance evaluation of a carbon nanotube-based sensor array monitoring pH and active chlorine in drink water. ISOEN 2022: 1-3 - 2021
- [j13]Guillaume Perrin
Point process-based approaches for the reliability analysis of systems modeled by costly simulators. Reliab. Eng. Syst. Saf. 214: 107799 (2021) - [i3]Cécile Haberstich, Anthony Nouy, Guillaume Perrin
Active learning of tree tensor networks using optimal least-squares. CoRR abs/2104.13436 (2021) - [i2]Jhouben Cuesta-Ramirez, Rodolphe Le Riche, Olivier Roustant, Guillaume Perrin
A comparison of mixed-variables Bayesian optimization approaches. CoRR abs/2111.01533 (2021) - 2020
- [j12]Guillaume Perrin
Adaptive method for indirect identification of the statistical properties of random fields in a Bayesian framework. Comput. Stat. 35(1): 111-133 (2020) - [j11]Sophie Marque-Pucheu, Guillaume Perrin
An efficient dimension reduction for the Gaussian process emulation of two nested codes with functional outputs. Comput. Stat. 35(3): 1059-1099 (2020) - [j10]Olivier Roustant, Esperan Padonou, Yves Deville
Group Kernels for Gaussian Process Metamodels with Categorical Inputs. SIAM/ASA J. Uncertain. Quantification 8(2): 775-806 (2020) - [j9]Coralie Martinez, Emmanuel Ramasso
Adaptive early classification of temporal sequences using deep reinforcement learning. Knowl. Based Syst. 190: 105290 (2020) - [j8]Guillaume Perrin:
Adaptive calibration of a computer code with time-series output. Reliab. Eng. Syst. Saf. 196: 106728 (2020)
2010 – 2019
- 2019
- [j7]Guillaume Perrin, G. Defaux:
Efficient Evaluation of Reliability-Oriented Sensitivity Indices. J. Sci. Comput. 79(3): 1433-1455 (2019) - [i1]Cécile Haberstich, Anthony Nouy, Guillaume Perrin
Boosted optimal weighted least-squares. CoRR abs/1912.07075 (2019) - 2018
- [j6]Guillaume Perrin
Data-driven kernel representations for sampling with an unknown block dependence structure under correlation constraints. Comput. Stat. Data Anal. 119: 139-154 (2018) - [c5]Coralie Martinez, Guillaume Perrin, Emmanuel Ramasso
A Deep Reinforcement Learning Approach for Early Classification of Time Series. EUSIPCO 2018: 2030-2034 - 2017
- [j5]Guillaume Perrin
Nested polynomial trends for the improvement of Gaussian process-based predictors. J. Comput. Phys. 346: 389-402 (2017) - 2016
- [j4]Guillaume Perrin
Active learning surrogate models for the conception of systems with multiple failure modes. Reliab. Eng. Syst. Saf. 149: 130-136 (2016) - 2014
- [j3]Guillaume Perrin
A Posteriori Error and Optimal Reduced Basis for Stochastic Processes Defined by a Finite Set of Realizations. SIAM/ASA J. Uncertain. Quantification 2(1): 745-762 (2014) - 2013
- [j2]Guillaume Perrin
Karhunen-Loève expansion revisited for vector-valued random fields: Scaling, errors and optimal basis. J. Comput. Phys. 242: 607-622 (2013) - 2012
- [j1]Guillaume Perrin
Identification of Polynomial Chaos Representations in High Dimension from a Set of Realizations. SIAM J. Sci. Comput. 34(6) (2012)
2000 – 2009
- 2006
- [b1]Guillaume Perrin:
Etude du couvert forestier par processus ponctuels marqués. (Tree crown extraction using Marked Point Processes). École Centrale Paris, Châtenay-Malabry, France, 2006 - [c4]Guillaume Perrin, Xavier Descombes, Josiane Zerubia
2D and 3D Vegetation Resource Parameters Assessment using Marked Point Processes. ICPR (1) 2006: 1-4 - 2005
- [c3]Guillaume Perrin, Xavier Descombes, Josiane Zerubia
Adaptive Simulated Annealing for Energy Minimization Problem in a Marked Point Process Application. EMMCVPR 2005: 3-17 - [c2]Guillaume Perrin, Xavier Descombes, Josiane Zerubia
A marked point process model for tree crown extraction in plantations. ICIP (1) 2005: 661-664 - 2004
- [c1]Guillaume Perrin, Xavier Descombes, Josiane Zerubia
Tree crown extraction using marked point processes. EUSIPCO 2004: 2127-2130
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-05-08 20:59 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: