default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Barthelmé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Hugo Jaquard, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs. CoRR abs/2403.19300 (2024)- [i10]Konstantin Usevich, Simon Barthelmé:
Computing asymptotic eigenvectors and eigenvalues of perturbed symmetric matrices. CoRR abs/2407.17047 (2024) - 2023
- [c10]Simon Barthelmé, Nicolas Tremblay, Pierre-Olivier Amblard:
A Faster Sampler for Discrete Determinantal Point Processes. AISTATS 2023: 5582-5592 - [c9]Hugo Jaquard
, Michaël Fanuel, Pierre-Olivier Amblard, Rémi Bardenet, Simon Barthelmé, Nicolas Tremblay:
Smoothing Complex-Valued Signals on Graphs with Monte-Carlo. ICASSP 2023: 1-5 - 2022
- [c8]Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Variance Reduction in Stochastic Methods for Large-Scale Regularized Least-Squares Problems. EUSIPCO 2022: 1771-1775 - [i9]Simon Barthelmé, Pierre-Olivier Amblard, Nicolas Tremblay, Konstantin Usevich:
Gaussian Process Regression in the Flat Limit. CoRR abs/2201.01074 (2022) - [i8]Simon Barthelmé, Nicolas Tremblay, Pierre-Olivier Amblard:
A Faster Sampler for Discrete Determinantal Point Processes. CoRR abs/2210.17358 (2022) - 2021
- [j9]Simon Barthelmé, Konstantin Usevich:
Spectral Properties of Kernel Matrices in the Flat Limit. SIAM J. Matrix Anal. Appl. 42(1): 17-57 (2021) - [j8]Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Graph Tikhonov Regularization and Interpolation Via Random Spanning Forests. IEEE Trans. Signal Inf. Process. over Networks 7: 359-374 (2021) - 2020
- [c7]Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Smoothing Graph Signals via Random Spanning Forests. ICASSP 2020: 5630-5634 - [i7]Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Graph Tikhonov Regularization and Interpolation via Random Spanning Forests. CoRR abs/2011.10450 (2020)
2010 – 2019
- 2019
- [j7]Nicolas Tremblay, Simon Barthelmé, Pierre-Olivier Amblard:
Determinantal Point Processes for Coresets. J. Mach. Learn. Res. 20: 168:1-168:70 (2019) - [j6]Simon Barthelmé, David Tschumperlé:
imager: an R package for image processing based on CImg. J. Open Source Softw. 4(38): 1012 (2019) - [j5]Camille Breuil, Ben Jennings, Simon Barthelmé, Nathalie Guyader, Frederick A. A. Kingdom:
Color improves edge classification in human vision. PLoS Comput. Biol. 15(10) (2019) - [c6]Pierre Maho, Carlos Leonardo Dolcinotti, Thierry Livache, Cyril Herrier, Anton Andreev, Pierre Comon, Simon Barthelmé:
Olfactive robot for gas discrimination over several months using a new optoelectronic nose. ISOEN 2019: 1-3 - [i6]Yusuf Yigit Pilavci, Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Smoothing graph signals via random spanning forests. CoRR abs/1910.07963 (2019) - [i5]Simon Barthelmé, Konstantin Usevich:
Spectral properties of kernel matrices in the flat limit. CoRR abs/1910.14067 (2019) - 2018
- [c5]Pierre Maho, Simon Barthelmé, Pierre Comon:
Non-Linear Source Separation Under the Langmuir Model for Chemical Sensors. SAM 2018: 380-384 - [c4]Pierre-Olivier Amblard, Simon Barthelmé, Nicolas Tremblay:
Subsampling with K Determinantal Point Processes for Estimating Statistics in Large Data Sets. SSP 2018: 313-317 - [i4]Nicolas Tremblay, Simon Barthelmé, Pierre-Olivier Amblard:
Optimized Algorithms to Sample Determinantal Point Processes. CoRR abs/1802.08471 (2018) - [i3]Nicolas Tremblay, Simon Barthelmé, Pierre-Olivier Amblard:
Determinantal Point Processes for Coresets. CoRR abs/1803.08700 (2018) - 2017
- [c3]Nicolas Tremblay, Pierre-Olivier Amblard, Simon Barthelmé:
Graph sampling with determinantal processes. EUSIPCO 2017: 1674-1678 - [i2]Nicolas Tremblay, Pierre-Olivier Amblard, Simon Barthelmé:
Graph sampling with determinantal processes. CoRR abs/1703.01594 (2017) - [i1]Nicolas Tremblay, Simon Barthelmé, Pierre-Olivier Amblard:
Echantillonnage de signaux sur graphes via des processus déterminantaux. CoRR abs/1704.02239 (2017) - 2016
- [j4]Gina Gruenhage, Manfred Opper, Simon Barthelmé:
Visualizing the effects of a changing distance on data using continuous embeddings. Comput. Stat. Data Anal. 104: 51-65 (2016) - 2015
- [j3]Simon Barthelmé:
Fast matrix computations for functional additive models. Stat. Comput. 25(1): 47-63 (2015) - [j2]Simon Barthelmé, Nicolas Chopin:
The Poisson transform for unnormalised statistical models. Stat. Comput. 25(4): 767-780 (2015) - [c2]Guillaume P. Dehaene, Simon Barthelmé:
Bounding errors of Expectation-Propagation. NIPS 2015: 244-252 - 2011
- [c1]Simon Barthelmé, Nicolas Chopin:
ABC-EP: Expectation Propagation for Likelihoodfree Bayesian Computation. ICML 2011: 289-296
2000 – 2009
- 2009
- [j1]Simon Barthelmé, Pascal Mamassian:
Evaluation of Objective Uncertainty in the Visual System. PLoS Comput. Biol. 5(9) (2009)
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-10-07 22:13 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:
