default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel J. Candès
Person information
- affiliation: Stanford University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]John J. Cherian, Emmanuel J. Candès:
Statistical Inference for Fairness Auditing. J. Mach. Learn. Res. 25: 149:1-149:49 (2024)- [j47]Isaac Gibbs, Emmanuel J. Candès:
Conformal Inference for Online Prediction with Arbitrary Distribution Shifts. J. Mach. Learn. Res. 25: 162:1-162:36 (2024) - [c27]Tijana Zrnic, Emmanuel J. Candès:
Active Statistical Inference. ICML 2024 - [i53]Zitong Yang, Emmanuel J. Candès, Lihua Lei:
Bellman Conformal Inference: Calibrating Prediction Intervals For Time Series. CoRR abs/2402.05203 (2024) - [i52]Emi Zeger, Yifei Wang, Aaron Mishkin, Tolga Ergen, Emmanuel J. Candès, Mert Pilanci:
A Library of Mirrors: Deep Neural Nets in Low Dimensions are Convex Lasso Models with Reflection Features. CoRR abs/2403.01046 (2024) - [i51]Tijana Zrnic, Emmanuel J. Candès:
Active Statistical Inference. CoRR abs/2403.03208 (2024) - [i50]John J. Cherian, Isaac Gibbs, Emmanuel J. Candès:
Large language model validity via enhanced conformal prediction methods. CoRR abs/2406.09714 (2024) - [i49]Kristina Gligoric, Tijana Zrnic, Cinoo Lee, Emmanuel J. Candès, Dan Jurafsky:
Can Unconfident LLM Annotations Be Used for Confident Conclusions? CoRR abs/2408.15204 (2024) - [i48]Zitong Yang, Neil Band, Shuangping Li, Emmanuel J. Candès, Tatsunori Hashimoto:
Synthetic continued pretraining. CoRR abs/2409.07431 (2024) - [i47]Parth Nobel, Daniel LeJeune, Emmanuel J. Candès:
RandALO: Out-of-sample risk estimation in no time flat. CoRR abs/2409.09781 (2024) - 2023
- [j46]Ying Jin, Emmanuel J. Candès:
Selection by Prediction with Conformal p-values. J. Mach. Learn. Res. 24: 244:1-244:41 (2023) - [j45]Parth Nobel
, Emmanuel J. Candès, Stephen P. Boyd:
Tractable Evaluation of Stein's Unbiased Risk Estimate With Convex Regularizers. IEEE Trans. Signal Process. 71: 4330-4341 (2023) - [c26]Anastasios Angelopoulos, Emmanuel J. Candès, Ryan J. Tibshirani:
Conformal PID Control for Time Series Prediction. NeurIPS 2023 - [c25]Kexin Huang, Ying Jin, Emmanuel J. Candès, Jure Leskovec:
Uncertainty Quantification over Graph with Conformalized Graph Neural Networks. NeurIPS 2023 - [i46]John J. Cherian, Emmanuel J. Candès:
Statistical Inference for Fairness Auditing. CoRR abs/2305.03712 (2023) - [i45]Kexin Huang, Ying Jin, Emmanuel J. Candès, Jure Leskovec:
Uncertainty Quantification over Graph with Conformalized Graph Neural Networks. CoRR abs/2305.14535 (2023) - [i44]Anastasios N. Angelopoulos, Emmanuel J. Candès, Ryan J. Tibshirani:
Conformal PID Control for Time Series Prediction. CoRR abs/2307.16895 (2023) - [i43]Tijana Zrnic, Emmanuel J. Candès:
Cross-Prediction-Powered Inference. CoRR abs/2309.16598 (2023) - 2022
- [j44]Charmaine Chia, Matteo Sesia, Chi-Sing Ho, Stefanie S. Jeffrey, Jennifer A. Dionne, Emmanuel J. Candès, Roger T. Howe:
Interpretable Classification of Bacterial Raman Spectra With Knockoff Wavelets. IEEE J. Biomed. Health Informatics 26(2): 740-748 (2022) - [i42]Isaac Gibbs, Emmanuel J. Candès:
Conformal Inference for Online Prediction with Arbitrary Distribution Shifts. CoRR abs/2208.08401 (2022) - [i41]Yifei Wang, Yixuan Hua, Emmanuel J. Candès, Mert Pilanci:
ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recovery. CoRR abs/2209.15265 (2022) - 2021
- [c24]Isaac Gibbs, Emmanuel J. Candès:
Adaptive Conformal Inference Under Distribution Shift. NeurIPS 2021: 1660-1672 - [i40]Isaac Gibbs, Emmanuel J. Candès:
Adaptive Conformal Inference Under Distribution Shift. CoRR abs/2106.00170 (2021) - [i39]Anastasios N. Angelopoulos, Stephen Bates, Emmanuel J. Candès, Michael I. Jordan, Lihua Lei:
Learn then Test: Calibrating Predictive Algorithms to Achieve Risk Control. CoRR abs/2110.01052 (2021) - 2020
- [c23]Yaniv Romano, Stephen Bates, Emmanuel J. Candès:
Achieving Equalized Odds by Resampling Sensitive Attributes. NeurIPS 2020 - [c22]Yaniv Romano, Matteo Sesia, Emmanuel J. Candès:
Classification with Valid and Adaptive Coverage. NeurIPS 2020 - [i38]Yaniv Romano, Stephen Bates, Emmanuel J. Candès:
Achieving Equalized Odds by Resampling Sensitive Attributes. CoRR abs/2006.04292 (2020)
2010 – 2019
- 2019
- [c21]Ryan J. Tibshirani, Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ramdas:
Conformal Prediction Under Covariate Shift. NeurIPS 2019: 2526-2536 - [c20]Yaniv Romano, Evan Patterson, Emmanuel J. Candès:
Conformalized Quantile Regression. NeurIPS 2019: 3538-3548 - [i37]David A. Barmherzig, Ju Sun, Emmanuel J. Candès, T. J. Lane, Po-Nan Li:
Holographic Phase Retrieval and Optimal Reference Design. CoRR abs/1901.06453 (2019) - [i36]David A. Barmherzig, Ju Sun, Emmanuel J. Candès, T. J. Lane, Po-Nan Li:
Dual-Reference Design for Holographic Coherent Diffraction Imaging. CoRR abs/1902.02492 (2019) - [i35]Yaniv Romano, Rina Foygel Barber, Chiara Sabatti, Emmanuel J. Candès:
With Malice Towards None: Assessing Uncertainty via Equalized Coverage. CoRR abs/1908.05428 (2019) - 2017
- [i34]Pragya Sur, Yuxin Chen, Emmanuel J. Candès:
The Likelihood Ratio Test in High-Dimensional Logistic Regression Is Asymptotically a Rescaled Chi-Square. CoRR abs/1706.01191 (2017) - 2016
- [j43]Weijie Su, Stephen P. Boyd, Emmanuel J. Candès:
A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights. J. Mach. Learn. Res. 17: 153:1-153:43 (2016) - [j42]Veniamin I. Morgenshtern, Emmanuel J. Candès:
Super-Resolution of Positive Sources: The Discrete Setup. SIAM J. Imaging Sci. 9(1): 412-444 (2016) - [i33]Yuxin Chen, Emmanuel J. Candès:
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences. CoRR abs/1609.05820 (2016) - 2015
- [j41]Rafi Witten, Emmanuel J. Candès:
Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds. Algorithmica 72(1): 264-281 (2015) - [j40]Brendan O'Donoghue, Emmanuel J. Candès:
Adaptive Restart for Accelerated Gradient Schemes. Found. Comput. Math. 15(3): 715-732 (2015) - [j39]Emmanuel J. Candès, Yonina C. Eldar, Thomas Strohmer, Vladislav Voroninski:
Phase Retrieval via Matrix Completion. SIAM Rev. 57(2): 225-251 (2015) - [j38]Emmanuel J. Candès, Xiaodong Li, Mahdi Soltanolkotabi:
Phase Retrieval via Wirtinger Flow: Theory and Algorithms. IEEE Trans. Inf. Theory 61(4): 1985-2007 (2015) - [c19]Yuxin Chen, Emmanuel J. Candès:
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems. NIPS 2015: 739-747 - [i32]Emmanuel J. Candès, Weijie Su:
SLOPE is Adaptive to Unknown Sparsity and Asymptotically Minimax. CoRR abs/1503.08393 (2015) - [i31]Veniamin I. Morgenshtern, Emmanuel J. Candès:
Super-Resolution of Positive Sources: the Discrete Setup. CoRR abs/1504.00717 (2015) - [i30]Yuxin Chen, Emmanuel J. Candès:
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems. CoRR abs/1505.05114 (2015) - [i29]Weijie Su, Malgorzata Bogdan, Emmanuel J. Candès:
False Discoveries Occur Early on the Lasso Path. CoRR abs/1511.01957 (2015) - 2014
- [j37]Emmanuel J. Candès, Xiaodong Li:
Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns. Found. Comput. Math. 14(5): 1017-1026 (2014) - [c18]Weijie Su, Stephen P. Boyd, Emmanuel J. Candès:
A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights. NIPS 2014: 2510-2518 - [i28]Emmanuel J. Candès, Xiaodong Li, Mahdi Soltanolkotabi:
Phase Retrieval via Wirtinger Flow: Theory and Algorithms. CoRR abs/1407.1065 (2014) - 2013
- [j36]Emmanuel J. Candès, Benjamin Recht:
Simple bounds for recovering low-complexity models. Math. Program. 141(1-2): 577-589 (2013) - [j35]Emmanuel J. Candès, Yonina C. Eldar, Thomas Strohmer, Vladislav Voroninski:
Phase Retrieval via Matrix Completion. SIAM J. Imaging Sci. 6(1): 199-225 (2013) - [j34]Ery Arias-Castro, Emmanuel J. Candès, Mark A. Davenport:
On the Fundamental Limits of Adaptive Sensing. IEEE Trans. Inf. Theory 59(1): 472-481 (2013) - [j33]Emmanuel J. Candès, Carlos A. Sing-Long, Joshua D. Trzasko:
Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators. IEEE Trans. Signal Process. 61(19): 4643-4657 (2013) - [c17]Emmanuel J. Candès, Stephen Becker:
Compressive sensing: Principles and hardware implementations. ESSCIRC 2013: 22-23 - [c16]Carlos Fernandez-Granda, Emmanuel J. Candès:
Super-resolution via Transform-Invariant Group-Sparse Regularization. ICCV 2013: 3336-3343 - [i27]Mahdi Soltanolkotabi, Ehsan Elhamifar, Emmanuel J. Candès:
Robust Subspace Clustering. CoRR abs/1301.2603 (2013) - [i26]Makhlad Chahid, Jérôme Bobin, Hamed Shams Mousavi, Emmanuel J. Candès, Maxime Dahan, Vincent Studer:
Hyperspectral fluorescence microscopy based on Compressive Sampling. CoRR abs/1307.4610 (2013) - [i25]Rafi Witten, Emmanuel J. Candès:
Randomized algorithms for low-rank matrix factorizations: sharp performance bounds. CoRR abs/1308.5697 (2013) - [i24]Emmanuel J. Candès, Xiaodong Li, Mahdi Soltanolkotabi:
Phase Retrieval from masked Fourier transforms. CoRR abs/1310.3240 (2013) - 2012
- [j32]Emmanuel J. Candès, Benjamin Recht:
Exact matrix completion via convex optimization. Commun. ACM 55(6): 111-119 (2012) - [j31]Michael B. Wakin, Stephen Becker, Eric B. Nakamura, Michael C. Grant, Emilio A. Sovero, Daniel Ching, Juhwan Yoo, Justin K. Romberg, Azita Emami-Neyestanak, Emmanuel J. Candès:
A Nonuniform Sampler for Wideband Spectrally-Sparse Environments. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 516-529 (2012) - [j30]Juhwan Yoo, Christopher K. Turnes, Eric B. Nakamura, Chi K. Le, Stephen Becker, Emilio A. Sovero, Michael B. Wakin, Michael C. Grant, Justin K. Romberg, Azita Emami-Neyestanak, Emmanuel J. Candès:
A Compressed Sensing Parameter Extraction Platform for Radar Pulse Signal Acquisition. IEEE J. Emerg. Sel. Topics Circuits Syst. 2(3): 626-638 (2012) - [c15]Juhwan Yoo, Stephen Becker, Manuel Monge, Matthew Loh, Emmanuel J. Candès, Azita Emami-Neyestanak:
Design and implementation of a fully integrated compressed-sensing signal acquisition system. ICASSP 2012: 5325-5328 - [i23]Emmanuel J. Candès, Carlos Fernandez-Granda:
Towards a Mathematical Theory of Super-Resolution. CoRR abs/1203.5871 (2012) - [i22]Emmanuel J. Candès, Xiaodong Li:
Solving Quadratic Equations via PhaseLift when There Are About As Many Equations As Unknowns. CoRR abs/1208.6247 (2012) - [i21]Ewout van den Berg, Emmanuel J. Candès, Garry Chinn, Craig S. Levin, Peter D. Olcott, Carlos A. Sing-Long:
A single-photon sampling architecture for solid-state imaging. CoRR abs/1209.2262 (2012) - [i20]Emmanuel J. Candès, Carlos Fernandez-Granda:
Super-Resolution from Noisy Data. CoRR abs/1211.0290 (2012) - [i19]Emmanuel J. Candès, Mahdi Soltanolkotabi:
Discussion: Latent variable graphical model selection via convex optimization. CoRR abs/1211.0817 (2012) - 2011
- [j29]Emmanuel J. Candès, Xiaodong Li, Yi Ma, John Wright:
Robust principal component analysis? J. ACM 58(3): 11:1-11:37 (2011) - [j28]Stephen Becker, Emmanuel J. Candès, Michael C. Grant:
Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(3): 165-218 (2011) - [j27]Stephen Becker, Jérôme Bobin, Emmanuel J. Candès:
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery. SIAM J. Imaging Sci. 4(1): 1-39 (2011) - [j26]Emmanuel J. Candès, Yaniv Plan:
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements. IEEE Trans. Inf. Theory 57(4): 2342-2359 (2011) - [j25]Emmanuel J. Candès, Yaniv Plan:
A Probabilistic and RIPless Theory of Compressed Sensing. IEEE Trans. Inf. Theory 57(11): 7235-7254 (2011) - [i18]Emmanuel J. Candès, Mark A. Davenport:
How well can we estimate a sparse vector? CoRR abs/1104.5246 (2011) - [i17]Emmanuel J. Candès, Benjamin Recht:
Simple Bounds for Low-complexity Model Reconstruction. CoRR abs/1106.1474 (2011) - [i16]Emmanuel J. Candès, Yonina C. Eldar, Thomas Strohmer, Vladislav Voroninski:
Phase Retrieval via Matrix Completion. CoRR abs/1109.0573 (2011) - [i15]Emmanuel J. Candès, Thomas Strohmer, Vladislav Voroninski:
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming. CoRR abs/1109.4499 (2011) - [i14]Ery Arias-Castro, Emmanuel J. Candès, Mark A. Davenport:
On the Fundamental Limits of Adaptive Sensing. CoRR abs/1111.4646 (2011) - [i13]Mahdi Soltanolkotabi, Emmanuel J. Candès:
A Geometric Analysis of Subspace Clustering with Outliers. CoRR abs/1112.4258 (2011) - 2010
- [j24]Richard G. Baraniuk, Emmanuel J. Candès, Michael Elad, Yi Ma:
Applications of Sparse Representation and Compressive Sensing. Proc. IEEE 98(6): 906-909 (2010) - [j23]Emmanuel J. Candès, Yaniv Plan:
Matrix Completion With Noise. Proc. IEEE 98(6): 925-936 (2010) - [j22]Jian-Feng Cai, Emmanuel J. Candès, Zuowei Shen:
A Singular Value Thresholding Algorithm for Matrix Completion. SIAM J. Optim. 20(4): 1956-1982 (2010) - [j21]Argyrios Zymnis, Stephen P. Boyd, Emmanuel J. Candès:
Compressed Sensing With Quantized Measurements. IEEE Signal Process. Lett. 17(2): 149-152 (2010) - [j20]Emmanuel J. Candès, Terence Tao:
The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5): 2053-2080 (2010) - [c14]Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel J. Candès, Yi Ma:
Dense error correction for low-rank matrices via Principal Component Pursuit. ISIT 2010: 1513-1517 - [c13]Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. Candès, Yi Ma:
Stable Principal Component Pursuit. ISIT 2010: 1518-1522 - [c12]Emmanuel J. Candès:
The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing. SODA 2010: 1321 - [i12]Emmanuel J. Candès, Yaniv Plan:
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements. CoRR abs/1001.0339 (2010) - [i11]Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel J. Candès, Yi Ma:
Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit. CoRR abs/1001.2362 (2010) - [i10]Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. Candès, Yi Ma:
Stable Principal Component Pursuit. CoRR abs/1001.2363 (2010) - [i9]Emmanuel J. Candès, Yonina C. Eldar, Deanna Needell:
Compressed Sensing with Coherent and Redundant Dictionaries. CoRR abs/1005.2613 (2010) - [i8]Emmanuel J. Candès, Yaniv Plan:
A probabilistic and RIPless theory of compressed sensing. CoRR abs/1011.3854 (2010)
2000 – 2009
- 2009
- [j19]Emmanuel J. Candès, Benjamin Recht:
Exact Matrix Completion via Convex Optimization. Found. Comput. Math. 9(6): 717-772 (2009) - [j18]Emmanuel J. Candès, Laurent Demanet, Lexing Ying:
A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators. Multiscale Model. Simul. 7(4): 1727-1750 (2009) - [c11]Emmanuel J. Candès, Yaniv Plan:
Accurate low-rank matrix recovery from a small number of linear measurements. Allerton 2009: 1223-1230 - [c10]Jérôme Bobin, Emmanuel J. Candès:
A fast and accurate first-order algorithm for compressed sensing. ICIP 2009: 1457-1460 - [i7]Emmanuel J. Candès, Terence Tao:
The Power of Convex Relaxation: Near-Optimal Matrix Completion. CoRR abs/0903.1476 (2009) - [i6]Emmanuel J. Candès, Yaniv Plan:
Matrix Completion With Noise. CoRR abs/0903.3131 (2009) - [i5]Emmanuel J. Candès, Yaniv Plan:
Accurate low-rank matrix recovery from a small number of linear measurements. CoRR abs/0910.0413 (2009) - [i4]Emmanuel J. Candès, Xiaodong Li, Yi Ma, John Wright:
Robust Principal Component Analysis? CoRR abs/0912.3599 (2009) - 2008
- [j17]Richard G. Baraniuk, Emmanuel J. Candès, Robert D. Nowak, Martin Vetterli:
Compressive Sampling [From the Guest Editors]. IEEE Signal Process. Mag. 25(2): 12-13 (2008) - [j16]Emmanuel J. Candès, Michael B. Wakin:
An Introduction To Compressive Sampling. IEEE Signal Process. Mag. 25(2): 21-30 (2008) - [j15]Emmanuel J. Candès, Paige A. Randall:
Highly Robust Error Correction byConvex Programming. IEEE Trans. Inf. Theory 54(7): 2829-2840 (2008) - [c9]Emmanuel J. Candès:
Session TA1b: Compressive sensing. ACSCC 2008: 1040-1042 - [c8]Maryam Fazel, Emmanuel J. Candès, Ben Recht, Pablo A. Parrilo:
Compressed sensing and robust recovery of low rank matrices. ACSCC 2008: 1043-1047 - [c7]Emmanuel J. Candès, Benjamin Recht:
Exact low-rank matrix completion via convex optimization. Allerton 2008: 806-812 - [i3]Emmanuel J. Candès, Benjamin Recht:
Exact Matrix Completion via Convex Optimization. CoRR abs/0805.4471 (2008) - 2007
- [j14]Emmanuel J. Candès, Justin K. Romberg:
Errata for Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions. Found. Comput. Math. 7(4): 529-531 (2007) - [j13]Emmanuel J. Candès, Laurent Demanet, Lexing Ying:
Fast Computation of Fourier Integral Operators. SIAM J. Sci. Comput. 29(6): 2464-2493 (2007) - [c6]Emmanuel J. Candès, Nathaniel Braun, Michael B. Wakin:
Sparse Signal and Image Recovery from Compressive Samples. ISBI 2007: 976-979 - 2006
- [j12]Emmanuel J. Candès, Justin K. Romberg:
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions. Found. Comput. Math. 6(2): 227-254 (2006) - [j11]Lexing Ying, Emmanuel J. Candès:
Fast geodesics computation with the phase flow method. J. Comput. Phys. 220(1): 6-18 (2006) - [j10]Lexing Ying, Emmanuel J. Candès:
The phase flow method. J. Comput. Phys. 220(1): 184-215 (2006) - [j9]Emmanuel J. Candès, Laurent Demanet, David L. Donoho, Lexing Ying:
Fast Discrete Curvelet Transforms. Multiscale Model. Simul. 5(3): 861-899 (2006) - [j8]Emmanuel J. Candès, Justin K. Romberg, Terence Tao:
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2): 489-509 (2006) - [j7]Emmanuel J. Candès, Terence Tao:
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? IEEE Trans. Inf. Theory 52(12): 5406-5425 (2006) - [c5]Emmanuel J. Candès, Justin K. Romberg:
Encoding the \ell_p Ball from Limited Measurements. DCC 2006: 33-42 - [c4]Emmanuel J. Candès, Justin K. Romberg:
Robust Signal Recovery from Incomplete Observations. ICIP 2006: 1281-1284 - [i2]Emmanuel J. Candès, Paige A. Randall:
Highly robust error correction by convex programming. CoRR abs/cs/0612124 (2006) - 2005
- [j6]Emmanuel J. Candès, Terence Tao:
Decoding by linear programming. IEEE Trans. Inf. Theory 51(12): 4203-4215 (2005) - [c3]Emmanuel J. Candès, Justin K. Romberg:
Signal recovery from random projections. Computational Imaging 2005: 76-86 - [c2]Emmanuel J. Candès, Mark Rudelson, Terence Tao, Roman Vershynin:
Error Correction via Linear Programming. FOCS 2005: 295-308 - [i1]Emmanuel J. Candès, Terence Tao:
Decoding by Linear Programming. CoRR abs/math/0502327 (2005) - 2003
- [j5]Jean-Luc Starck, Fionn Murtagh, Emmanuel J. Candès, David L. Donoho:
Gray and color image contrast enhancement by the curvelet transform. IEEE Trans. Image Process. 12(6): 706-717 (2003) - 2002
- [j4]Emmanuel J. Candès, Franck Guo:
New multiscale transforms, minimum total variation synthesis: applications to edge-preserving image reconstruction. Signal Process. 82(11): 1519-1543 (2002) - [j3]Jean-Luc Starck, Emmanuel J. Candès, David L. Donoho:
The curvelet transform for image denoising. IEEE Trans. Image Process. 11(6): 670-684 (2002) - 2001
- [j2]Emmanuel J. Candès, David L. Donoho:
Curvelets and Curvilinear Integrals. J. Approx. Theory 113(1): 59-90 (2001) - [j1]Emmanuel J. Candès:
Ridgelets and the Representation of Mutilated Sobolev Functions. SIAM J. Math. Anal. 33(2): 347-368 (2001) - [c1]Emmanuel J. Candès:
The curvelet transform for image denoising. ICIP (1) 2001: 7
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-22 21:15 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:
