School of Humanities and Sciences
Showing 1-5 of 5 Results
Barnum-Simons Chair of Math and Statistics, and Professor of Statistics and, by courtesy, of Electrical Engineering
BioEmmanuel Candès is the Barnum-Simons Chair in Mathematics and Statistics, a professor of electrical engineering (by courtesy) and a member of the Institute of Computational and Mathematical Engineering at Stanford University. Earlier, Candès was the Ronald and Maxine Linde Professor of Applied and Computational Mathematics at the California Institute of Technology. His research interests are in computational harmonic analysis, statistics, information theory, signal processing and mathematical optimization with applications to the imaging sciences, scientific computing and inverse problems. He received his Ph.D. in statistics from Stanford University in 1998.
Candès has received several awards including the Alan T. Waterman Award from NSF, which is the highest honor bestowed by the National Science Foundation, and which recognizes the achievements of early-career scientists. He has given over 60 plenary lectures at major international conferences, not only in mathematics and statistics but in many other areas as well including biomedical imaging and solid-state physics. He was elected to the National Academy of Sciences and to the American Academy of Arts and Sciences in 2014.
Ann and Bill Swindells Professor, Emeritus
BioDr. Carlsson has been a professor of mathematics at Stanford University since 1991. In the last ten years, he has been involved in adapting topological techniques to data analysis, under NSF funding and as the lead PI on the DARPA “Topological Data Analysis” project from 2005 to 2010. He is the lead organizer of the ATMCS conferences, and serves as an editor of several Mathematics journals
Donald E. Knuth Professor and Professor, by courtesy, of Mathematics
Current Research and Scholarly InterestsEfficient algorithmic techniques for processing, searching and indexing massive high-dimensional data sets; efficient algorithms for computational problems in high-dimensional statistics and optimization problems in machine learning; approximation algorithms for discrete optimization problems with provable guarantees; convex optimization approaches for non-convex combinatorial optimization problems; low-distortion embeddings of finite metric spaces.