HOME





Jon Kleinberg
Jon Michael Kleinberg (born 1971) is an American computer scientist and the Tisch University Professor of Computer Science and Information Science at Cornell University known for his work in algorithms and networks. He is a recipient of the Nevanlinna Prize by the International Mathematical Union. Early life and education Jon Kleinberg was born in 1971 in Boston, Massachusetts to a mathematics professor father and a computer consultant mother. He received a Bachelor of Science degree in computer science from Cornell University in 1993 and a PhD from Massachusetts Institute of Technology in 1996. He is the older brother of fellow Cornell computer scientist Robert Kleinberg. Career Since 1996 Kleinberg has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fel ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Robert Kleinberg
Robert David Kleinberg (also referred to as Bobby Kleinberg) is an American theoretical computer scientist and professor of Computer Science at Cornell University. Early life Robert Kleinberg was one of the finalists at the 1989 Mathcounts. He was a member of the 1991 and 1992 USA teams in the International Mathematical Olympiad, winning a silver medal and a gold medal, respectively. He was also a Putnam Fellow in 1996. He graduated from Iroquois Central High School in Elma, NY, where he was valedictorian. He is the younger brother of fellow Cornell computer scientist Jon Kleinberg. Research Robert Kleinberg is known for his research work on group theoretic algorithms for matrix multiplication, online learning, network coding and greedy embedding, social networks and algorithmic game theory. Career Robert Kleinberg received a B.A. in mathematics from Cornell University in 1997 and a Ph.D. in mathematics under Tom Leighton from MIT The Massachusetts Institute of Techn ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Éva Tardos
Éva Tardos (born 1 October 1957) is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University. Tardos's research interest is algorithms. Her work focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory and simple auctions. Education and career Tardos received her Dipl. Math in 1981 and her Ph.D. 1984 from the Faculty of Sciences of the Eötvös Loránd University under her advisor András Frank. She was the Chair of the Department of Computer Science at Cornell from 2006-2010, and she is currently serving as the Associate Dean of the College of Computing and Information Science. She was editor-in-Chief of ''SIAM Journal on Computing'' from 2004-2009, and is currently the Economics and Com ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Stanley Milgram
Stanley Milgram (August 15, 1933 – December 20, 1984) was an American social psychologist, best known for his controversial experiments on obedience conducted in the 1960s during his professorship at Yale.Blass, T. (2004). ''The Man Who Shocked the World: The Life and Legacy of Stanley Milgram''. Milgram was influenced by the events of the Holocaust, especially the trial of Adolf Eichmann, in developing the experiment. After earning a PhD in social psychology from Harvard University, he taught at Yale, Harvard, and then for most of his career as a professor at the City University of New York Graduate Center, until his death in 1984. Milgram gained notoriety for his obedience experiment conducted in the basement of Linsly-Chittenden Hall at Yale University in 1961, three months after the start of the trial of German Nazi war criminal Adolf Eichmann in Jerusalem. The experiment found, unexpectedly, that a very high proportion of subjects would fully obey the instructions, al ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Small World Experiment
The small-world experiment comprised several experiments conducted by Stanley Milgram and other researchers examining the average path length for social networks of people in the United States. The research was groundbreaking in that it suggested that human society is a small-world-type network characterized by short path-lengths. The experiments are often associated with the phrase "six degrees of separation", although Milgram did not use this term himself. Historical context of the small-world problem Guglielmo Marconi's conjectures based on his radio work in the early 20th century, which were articulated in his 1909 Nobel Prize address, may have inspired Hungarian author Frigyes Karinthy to write a challenge to find another person to whom he could not be connected through at most five people.Barabási, Albert-László
. 2003.

[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

PageRank
PageRank (PR) is an algorithm used by Google Search to rank web pages in their search engine results. It is named after both the term "web page" and co-founder Larry Page. PageRank is a way of measuring the importance of website pages. According to Google: Currently, PageRank is not the only algorithm used by Google to order search results, but it is the first algorithm that was used by the company, and it is the best known. As of September 24, 2019, PageRank and all associated patents are expired. Description PageRank is a link analysis algorithm and it assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set. The algorithm may be applied to any collection of entities with reciprocal quotations and references. The numerical weight that it assigns to any given element ''E'' is referred to as the ''PageRank of E'' and denoted by PR(E). A PageRank re ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Eigenvector
In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denoted by \lambda, is the factor by which the eigenvector is scaled. Geometrically, an eigenvector, corresponding to a real nonzero eigenvalue, points in a direction in which it is stretched by the transformation and the eigenvalue is the factor by which it is stretched. If the eigenvalue is negative, the direction is reversed. Loosely speaking, in a multidimensional vector space, the eigenvector is not rotated. Formal definition If is a linear transformation from a vector space over a field into itself and is a nonzero vector in , then is an eigenvector of if is a scalar multiple of . This can be written as T(\mathbf) = \lambda \mathbf, where is a scalar in , known as the eigenvalue, characteristic value, or characteristic root ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Complex Network
In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research (since 2000) inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks. Definition Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In the case of directed networks these fea ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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]  




Fellow
A fellow is a concept whose exact meaning depends on context. In learned or professional societies, it refers to a privileged member who is specially elected in recognition of their work and achievements. Within the context of higher educational institutions, a fellow can be a member of a highly ranked group of teachers at a particular college or university or a member of the governing body in some universities (such as the Fellows of Harvard College); it can also be a specially selected postgraduate student who has been appointed to a post (called a fellowship) granting a stipend, research facilities and other privileges for a fixed period (usually one year or more) in order to undertake some advanced study or research, often in return for teaching services. In the context of research and development-intensive large companies or corporations, the title "fellow" is sometimes given to a small number of senior scientists and engineers. In the context of medical education in N ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Notices Of The American Mathematical Society
''Notices of the American Mathematical Society'' is the membership journal of the American Mathematical Society (AMS), published monthly except for the combined June/July issue. The first volume appeared in 1953. Each issue of the magazine since January 1995 is available in its entirety on the journal web site. Articles are peer-reviewed by an editorial board of mathematical experts. Since 2019, the editor-in-chief is Erica Flapan. The cover regularly features mathematical visualizations. The ''Notices'' is self-described to be the world's most widely read mathematical journal. As the membership journal of the American Mathematical Society, the ''Notices'' is sent to the approximately 30,000 AMS members worldwide, one-third of whom reside outside the United States. By publishing high-level exposition, the ''Notices'' provides opportunities for mathematicians to find out what is going on in the field. Each issue contains one or two such expository articles that describe current d ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

United States National Academy Of Sciences
The National Academy of Sciences (NAS) is a United States nonprofit, non-governmental organization. NAS is part of the National Academies of Sciences, Engineering, and Medicine, along with the National Academy of Engineering (NAE) and the National Academy of Medicine (NAM). As a national academy, new members of the organization are elected annually by current members, based on their distinguished and continuing achievements in original research. Election to the National Academy is one of the highest honors in the scientific field. Members of the National Academy of Sciences serve '' pro bono'' as "advisers to the nation" on science, engineering, and medicine. The group holds a congressional charter under Title 36 of the United States Code. Founded in 1863 as a result of an Act of Congress that was approved by Abraham Lincoln, the NAS is charged with "providing independent, objective advice to the nation on matters related to science and technology. ... to provide sci ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]