default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonas Kahn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Maximilian März, Claire Boyer, Jonas Kahn, Pierre Weiss:
Sampling Rates for ℓ 1-Synthesis. Found. Comput. Math. 23(6): 2089-2150 (2023)- 2022
- [j10]Trystan Surawy-Stepney
, Jonas Kahn, Richard Kueng, Madalin Guta:
Projected Least-Squares Quantum Process Tomography. Quantum 6: 844 (2022) - 2020
- [j9]Léo Lebrat, Frédéric de Gournay, Jonas Kahn:
3/4-Discrete Optimal Transport. SIAM J. Sci. Comput. 42(4): A2088-A2107 (2020) - [i5]Maximilian März, Claire Boyer, Jonas Kahn, Pierre Weiss:
Sampling Rates for 𝓁1-Synthesis. CoRR abs/2004.07175 (2020)
2010 – 2019
- 2019
- [j8]Valentin Debarnot, Jonas Kahn, Pierre Weiss:
Multiview Attenuation Estimation and Correction. J. Math. Imaging Vis. 61(6): 780-797 (2019) - [j7]Frédéric de Gournay, Jonas Kahn, Léo Lebrat:
Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure. Numerische Mathematik 141(2): 429-453 (2019) - [j6]Andrés Hoyos Idrobo, Gaël Varoquaux, Jonas Kahn, Bertrand Thirion:
Recursive Nearest Agglomeration (ReNA): Fast Clustering for Approximation of Structured Signals. IEEE Trans. Pattern Anal. Mach. Intell. 41(3): 669-681 (2019) - [j5]Léo Lebrat, Frédéric de Gournay, Jonas Kahn, Pierre Weiss:
Optimal Transport Approximation of 2-Dimensional Measures. SIAM J. Imaging Sci. 12(2): 762-787 (2019) - [i4]Frédéric de Gournay, Jonas Kahn, Léo Lebrat:
Approximation of curves with piecewise constant or piecewise linear functions. CoRR abs/1909.04582 (2019) - 2018
- [i3]Madalin Guta, Jonas Kahn, Richard Kueng, Joel A. Tropp:
Fast state tomography with optimal error bounds. CoRR abs/1809.11162 (2018) - 2016
- [j4]Claire Boyer, Nicolas Chauffert, Philippe Ciuciu, Jonas Kahn, Pierre Weiss:
On the Generation of Sampling Schemes for Magnetic Resonance Imaging. SIAM J. Imaging Sci. 9(4): 2039-2072 (2016) - [j3]Nicolas Chauffert, Pierre Weiss, Jonas Kahn, Philippe Ciuciu:
A Projection Algorithm for Gradient Waveforms Design in Magnetic Resonance Imaging. IEEE Trans. Medical Imaging 35(9): 2026-2039 (2016) - [i2]Andrés Hoyos Idrobo, Gaël Varoquaux, Jonas Kahn, Bertrand Thirion:
Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals. CoRR abs/1609.04608 (2016) - 2015
- [j2]Jonas Kahn:
How many T-tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains. Random Struct. Algorithms 47(3): 561-587 (2015) - [i1]Bertrand Thirion, Andrés Hoyos Idrobo, Jonas Kahn, Gaël Varoquaux:
Fast clustering for scalable statistical analysis on structured images. CoRR abs/1511.04898 (2015) - 2014
- [j1]Nicolas Chauffert, Philippe Ciuciu, Jonas Kahn, Pierre Weiss:
Variable Density Sampling with Continuous Trajectories. SIAM J. Imaging Sci. 7(4): 1962-1992 (2014)
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-04-25 05: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:
