default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Feydy
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Antoine Diez, Jean Feydy:
An optimal transport model for dynamical shapes, collective motion and cellular aggregates. CoRR abs/2402.17086 (2024)- 2023
- [i5]Minh-Hieu Do, Jean Feydy, Olga Mula:
Approximation and Structured Prediction with Sparse Wasserstein Barycenters. CoRR abs/2302.05356 (2023) - 2022
- [c8]Pierre Sabatier, Jean Feydy
, Anne-Sophie Jannot:
Accelerating High-Dimensional Temporal Modelling Using Graphics Processing Units for Pharmacovigilance Signal Detection on Real-Life Data. MIE 2022: 83-87 - 2021
- [j1]Benjamin Charlier, Jean Feydy, Joan Alexis Glaunès, François-David Collin, Ghislain Durif:
Kernel Operations on the GPU, with Autodiff, without Memory Overflows. J. Mach. Learn. Res. 22: 74:1-74:6 (2021) - [c7]Freyr Sverrisson, Jean Feydy, Bruno E. Correia, Michael M. Bronstein:
Fast End-to-End Learning on Protein Surfaces. CVPR 2021: 15272-15281 - [c6]Zhengyang Shen, Jean Feydy, Peirong Liu, Ariel Hernán Curiale, Rubén San José Estépar, Raúl San José Estépar, Marc Niethammer:
Accurate Point Cloud Registration with Robust Optimal Transport. NeurIPS 2021: 5373-5389 - [i4]Jean Feydy, Pierre Roussillon, Alain Trouvé, Pietro Gori:
Fast and Scalable Optimal Transport for Brain Tractograms. CoRR abs/2107.02010 (2021) - [i3]Zhengyang Shen, Jean Feydy, Peirong Liu, Ariel Hernán Curiale, Rubén San José Estépar, Raúl San José Estépar, Marc Niethammer:
Accurate Point Cloud Registration with Robust Optimal Transport. CoRR abs/2111.00648 (2021) - 2020
- [c5]Jean Feydy, Joan Alexis Glaunès, Benjamin Charlier, Michael M. Bronstein:
Fast geometric learning with symbolic matrices. NeurIPS 2020 - [i2]Benjamin Charlier, Jean Feydy, Joan Alexis Glaunès, François-David Collin, Ghislain Durif:
Kernel Operations on the GPU, with Autodiff, without Memory Overflows. CoRR abs/2004.11127 (2020)
2010 – 2019
- 2019
- [c4]Jean Feydy, Thibault Séjourné, François-Xavier Vialard, Shun-ichi Amari, Alain Trouvé, Gabriel Peyré:
Interpolating between Optimal Transport and MMD using Sinkhorn Divergences. AISTATS 2019: 2681-2690 - [c3]Jean Feydy, Pierre Roussillon, Alain Trouvé, Pietro Gori:
Fast and Scalable Optimal Transport for Brain Tractograms. MICCAI (3) 2019: 636-644 - [i1]Thibault Séjourné, Jean Feydy, François-Xavier Vialard, Alain Trouvé, Gabriel Peyré:
Sinkhorn Divergences for Unbalanced Optimal Transport. CoRR abs/1910.12958 (2019) - 2018
- [c2]Jean Feydy, Alain Trouvé:
Global Divergences Between Measures: From Hausdorff Distance to Optimal Transport. ShapeMI@MICCAI 2018: 102-115 - 2017
- [c1]Jean Feydy, Benjamin Charlier, François-Xavier Vialard, Gabriel Peyré:
Optimal Transport for Diffeomorphic Registration. MICCAI (1) 2017: 291-299
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 00: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:
