|
Daniel Spielman
Daniel Alan Spielman (born March 1970 in Philadelphia, Pennsylvania) has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science. Education Daniel Spielman attended The Philadelphia School, and Germantown Friends School. He received his bachelor of arts degree in mathematics and computer science from Yale University in 1992 and a PhD in applied mathematics from MIT in 1995 (his dissertation was called "Computationally Efficient Error-Correcting Codes and Holographic Proofs"). He taught in the Mathematics Department at MIT from 1996 to 2005. Awards Spielman and his collaborator Shang-Hua Teng have jointly won the Gödel Prize twice: in 2008 for their work on smoothed analysis of algorithms and in 2015 for th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Philadelphia
Philadelphia, often called Philly, is the largest city in the Commonwealth of Pennsylvania, the sixth-largest city in the U.S., the second-largest city in both the Northeast megalopolis and Mid-Atlantic regions after New York City. Since 1854, the city has been coextensive with Philadelphia County, the most populous county in Pennsylvania and the urban core of the Delaware Valley, the nation's seventh-largest and one of world's largest metropolitan regions, with 6.245 million residents . The city's population at the 2020 census was 1,603,797, and over 56 million people live within of Philadelphia. Philadelphia was founded in 1682 by William Penn, an English Quaker. The city served as capital of the Pennsylvania Colony during the British colonial era and went on to play a historic and vital role as the central meeting place for the nation's founding fathers whose plans and actions in Philadelphia ultimately inspired the American Revolution and the nation's inde ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
George Pólya Prize
The Society for Industrial and Applied Mathematics (SIAM) has three prizes named after George Pólya: the George Pólya Prize for Mathematical Exposition, established in 2013; the George Pólya Prize in Applied Combinatorics, established in 1969, and first awarded in 1971; and the George Pólya Prize in Mathematics, established in 1992, to complement the exposition and applied combinatorics prizes. Frank Harary and William T. Tutte donated money to establish the original 1969 prize in combinatorics. Currently, funding for the three SIAM prizes is provided by the estate of Stella Pólya, the wife of George Pólya. Combinatorics Winners * 1971 Ronald L. Graham, Klaus Leeb, B. L. Rothschild, A. W. Hales, and R. I. Jewett * 1975 Richard P. Stanley, Endre Szemerédi, and Richard M. Wilson * 1979 László Lovász * 1983 Anders Björner and Paul Seymour * 1987 Andrew Yao * 1992 Gil Kalai and Saharon Shelah * 1994 Gregory Chudnovsky and Harry Kesten * 1996 Jeff Kahn and Davi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kadison–Singer Problem
In mathematics, the Kadison–Singer problem, posed in 1959, was a problem in functional analysis about whether certain extensions of certain linear functionals on certain C*-algebras were unique. The uniqueness was proved in 2013. The statement arose from work on the foundations of quantum mechanics done by Paul Dirac in the 1940s and was formalized in 1959 by Richard Kadison and Isadore Singer. The problem was subsequently shown to be equivalent to numerous open problems in pure mathematics, applied mathematics, engineering and computer science. Kadison, Singer, and most later authors believed the statement to be false, but, in 2013, it was proven true by Adam Marcus, Daniel Spielman and Nikhil Srivastava, who received the 2014 Pólya Prize for the achievement. The solution was made possible by a reformulation provided by Joel Anderson, who showed in 1979 that his "paving conjecture", which only involves operators on finite-dimensional Hilbert spaces, is equivalent to the Kadis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Adam Marcus (mathematician)
Adam Wade Marcus (born 1979) is an American mathematician. He holds the Chair of Combinatorial Analysis in the Institute of Mathematics at the École Polytechnique Fédérale de Lausanne. The team of Marcus, Daniel Spielman and Nikhil Srivastava was awarded the Pólya Prize in 2014 for their resolution of the Kadison–Singer problem and later the Michael and Sheila Held Prize in 2021 for their solution to long-standing conjectures in the study of Ramanujan graphs. History Marcus grew up in Marietta, Georgia and was a boarding student at the Darlington School in Rome, Georgia. He attended the Washington University in St. Louis for his undergraduate degree, where he was a Compton Fellow. He then completed his doctoral studies under the supervision of Prasad Tetali at the Georgia Institute of Technology. Following his graduation in 2008, he spent four years as a Gibbs Assistant Professor in Applied Mathematics at Yale University. In 2012, Marcus cofounded Crisply, an analytics comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MacArthur Fellowship
The MacArthur Fellows Program, also known as the MacArthur Fellowship and commonly but unofficially known as the "Genius Grant", is a prize awarded annually by the MacArthur Foundation, John D. and Catherine T. MacArthur Foundation typically to between 20 and 30 individuals, working in any field, who have shown "extraordinary originality and dedication in their creative pursuits and a marked capacity for self-direction" and are citizens or residents of the United States. According to the foundation's website, "the fellowship is not a reward for past accomplishment, but rather an investment in a person's originality, insight, and potential," but it also says such potential is "based on a track record of significant accomplishments." The current prize is $800,000 paid over five years in quarterly installments. Previously it was $625,000. This figure was increased from $500,000 in 2013 with the release of a review of the MacArthur Fellows Program. Since 1981, 1,111 people have been ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Association For Computing Machinery
The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membership group, claiming nearly 110,000 student and professional members . Its headquarters are in New York City. The ACM is an umbrella organization for academic and scholarly interests in computer science ( informatics). Its motto is "Advancing Computing as a Science & Profession". History In 1947, a notice was sent to various people: On January 10, 1947, at the Symposium on Large-Scale Digital Calculating Machinery at the Harvard computation Laboratory, Professor Samuel H. Caldwell of Massachusetts Institute of Technology spoke of the need for an association of those interested in computing machinery, and of the need for communication between them. ..After making some inquiries during May and June, we believe there is ample interest to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Smoothed Analysis
In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis has been used as a basis for considerable research, for problems ranging from mathematical programming, numerical analysis, machine learning, and data mining. It can give a more realistic analysis of the practical performance (e.g., running time, success rate, approximation quality) of the algorithm compared to analysis that uses worst-case or average-case scenarios. Smoothed analysis is a hybrid of worst-case and average-case analyses that inherits advantages of both. It measures the expected performance of algorithms under slight random perturbations of worst-case inputs. If the smoothed complexity of an algorithm is low, then it is unlikely that the algorithm will take a long time to solve practical instances whose data are subject to slight noises and imprecisions. Smoothed complexity results are strong probabilistic resul ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shang-Hua Teng
Shang-Hua Teng (; born 1964) is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California. Biography Teng was born in China in 1964. His father, Dr. Teng Zhanhong, was a professor of civil engineering at the Taiyuan University of Technology. His mother, Li Guixin, was an administrator at the same university. Teng graduated with BA in electrical engineering and BS in computer science, both from Shanghai Jiao Tong University in 1985. He obtained MS in computer science from the University of Southern California in 1988. Teng holds a Ph.D. in computer science from Carnegie Mellon University (in 1991). Prior to joining USC in 2009, Teng was a professor at Boston University. He has also taught at MIT, the University of Minnesota, and the University ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Germantown Friends School
Germantown Friends School (GFS) is a coeducational independent PreK–12 school in the Germantown neighborhood of Philadelphia, Pennsylvania, in the United States under the supervision of Germantown Monthly Meeting of the Religious Society of Friends (Quakers). It is governed by a School Committee whose members are drawn from the membership of the Meeting, the school's alumni, and parents of current students and alumni. The head of school is Dana Weeks. History Germantown Friends School was founded in 1845 by Germantown Monthly Meeting, which had grown in size and stature in the Philadelphia Quaker community during the previous several decades. The school was founded in response to a request from the Philadelphia Yearly Meeting. Until the early 20th century, Germantown Friends was a "select" school, meaning that only the children of Quaker parents were admitted. Germantown Monthly Meeting was an Orthodox meeting and valued classical education. Athletics and the arts were consid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sterling Professor
Sterling Professor, the highest academic rank at Yale University, is awarded to a tenured faculty member considered the best in his or her field. It is akin to the rank of university professor at other universities. The appointment, made by the President of Yale University and confirmed by the Yale Corporation, can be granted to any Yale faculty member, and up to forty professors can hold the title at the same time. The position was established through a 1918 bequest from John William Sterling, and the first Sterling Professor was appointed in 1920. History The professorships are named for and funded by a $15-million bequest left by John W. Sterling, partner in the New York law firm Shearman & Sterling and an 1864 graduate of Yale College. In addition to financing the university’s largest construction projects throughout the 1920s, including the Sterling Memorial Library and flagship facilities for many of its professional schools, Sterling stipulated the bequest would allow ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
