|
Andrei Broder
Andrei Zary Broder (born April 12, 1953 in Bucharest) is a distinguished scientist at Google. Previously, he was a research fellow and vice president of computational advertising for Yahoo!, and before that, the vice president of research for AltaVista. He has also worked for IBM Research as a distinguished engineer and was CTO of IBM's Institute for Search and Text Analysis. Education and career Broder was born in Bucharest, Romania, in 1953. His parents were medical doctors, his father a noted oncological surgeon. They emigrated to Israel in 1973, when Broder was in the second year of college in Romania, in the Electronics department at the Bucharest Polytechnic. He was accepted at Technion – Israel Institute of Technology, in the EE Department. Broder graduated from Technion in 1977, with a B.Sc. summa cum laude. He was then admitted to the PhD program at Stanford, where he initially planned to work in the systems area. His first adviser was Prof. John L. Hennessy. After r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrei Broder
Andrei Zary Broder (born April 12, 1953 in Bucharest) is a distinguished scientist at Google. Previously, he was a research fellow and vice president of computational advertising for Yahoo!, and before that, the vice president of research for AltaVista. He has also worked for IBM Research as a distinguished engineer and was CTO of IBM's Institute for Search and Text Analysis. Education and career Broder was born in Bucharest, Romania, in 1953. His parents were medical doctors, his father a noted oncological surgeon. They emigrated to Israel in 1973, when Broder was in the second year of college in Romania, in the Electronics department at the Bucharest Polytechnic. He was accepted at Technion – Israel Institute of Technology, in the EE Department. Broder graduated from Technion in 1977, with a B.Sc. summa cum laude. He was then admitted to the PhD program at Stanford, where he initially planned to work in the systems area. His first adviser was Prof. John L. Hennessy. After r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Aldous
David John Aldous FRS (born 13 July 1952) is a mathematician known for his research on probability theory and its applications, in particular in topics such as exchangeability, weak convergence, Markov chain mixing times, the continuum random tree and stochastic coalescence. He entered St. John's College, Cambridge, in 1970 and received his Ph.D. at the University of Cambridge in 1977 under his advisor, D. J. H. Garling. Since 1979 Aldous has been on the faculty at University of California, Berkeley. He was awarded the Rollo Davidson Prize in 1980, the Loève Prize in 1993, and was elected a Fellow of the Royal Society in 1994. In 2004, Aldous was elected a Fellow of the American Academy of Arts and Sciences. From 2004 to 2010, Aldous was an Andrew Dickson White Professor-at-Large at Cornell University. He was an invited speaker at the International Congress of Mathematicians (ICM) in 1998 in Berlin and a plenary speaker at the ICM in 2010 in Hyderabad. In 2012 he became a fell ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
W-shingling
In natural language processing a ''w-shingling'' is a set of ''unique'' ''shingles'' (therefore ''n-grams'') each of which is composed of contiguous subsequences of tokens within a document, which can then be used to ascertain the similarity between documents. The symbol ''w'' denotes the quantity of tokens in each shingle selected, or solved for. The document, "a rose is a rose is a rose" can therefore be maximally tokenized as follows: :(a,rose,is,a,rose,is,a,rose) The set of all contiguous ''sequences of 4 tokens'' (Thus 4=''n'', thus 4-''grams'') is : Which can then be reduced, or maximally shingled in this particular instance to . Resemblance For a given shingle size, the degree to which two documents ''A'' and ''B'' resemble each other can be expressed as the ratio of the magnitudes of their shinglings' intersection and union, or :r(A,B)= where , A, is the size of set A. The resemblance is a number in the range ,1 where 1 indicates that two documents are ident ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paris Kanellakis Award
The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing". It was instituted in 1996, in memory of Paris C. Kanellakis, a computer scientist who died with his immediate family in an airplane crash in South America in 1995 (American Airlines Flight 965). The award is accompanied by a prize of $10,000 and is endowed by contributions from Kanellakis's parents, with additional financial support provided by four ACM Special Interest Groups (SIGACT, SIGDA, SIGMOD, and SIGPLAN), the ACM SIG Projects Fund, and individual contributions. Winners See also * List of computer science awards This list of computer science awards is an index to articles on notable awards related to computer science. It includes lists of awards by the Association for Computing Machinery, the Institute of Electrical and Electronic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IEEE
The Institute of Electrical and Electronics Engineers (IEEE) is a 501(c)(3) professional association for electronic engineering and electrical engineering (and associated disciplines) with its corporate office in New York City and its operations center in Piscataway, New Jersey. The mission of the IEEE is ''advancing technology for the benefit of humanity''. The IEEE was formed from the amalgamation of the American Institute of Electrical Engineers and the Institute of Radio Engineers in 1963. Due to its expansion of scope into so many related fields, it is simply referred to by the letters I-E-E-E (pronounced I-triple-E), except on legal business documents. , it is the world's largest association of technical professionals with more than 423,000 members in over 160 countries around the world. Its objectives are the educational and technical advancement of electrical and electronic engineering, telecommunications, computer engineering and similar disciplines. History Origin ... [...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] |
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 No ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Web Graph
The webgraph describes the directed links between pages of the World Wide Web. A graph, in general, consists of several vertices, some pairs connected by edges. In a directed graph, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a hyperlink on page X, referring to page Y. Properties * The degree distribution of the webgraph strongly differs from the degree distribution of the classical random graph model, the Erdős–Rényi model: in the Erdős–Rényi model, there are very few large degree nodes, relative to the webgraph's degree distribution. The precise distribution is unclear, however: it is relatively well described by a lognormal distribution, as well as the Barabási–Albert model for power laws. * The webgraph is an example of a scale-free network. Applications The webgraph is used for: * computing the PageRank of the WWW-pages; * c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bow Tie (biology)
In the biological sciences, the term ''bow tie'' (so called for its shape) is a recent concept that tries to grasp the essence of some operational and functional structures observed in biological organisms and other kinds of complex and self-organizing systems. In general, bow tie architectures refer to ordered and recurrent structures that often underlie complex technological or biological systems, and that are capable of conferring them a balance among efficiency, robustness and evolvability. In other words, bow ties are able to take into account a great diversity of inputs (fanning in to the knot), showing a much smaller diversity in the protocols and processes (the ''knot'') able to elaborate these inputs, and finally an extremely heterogeneous diversity of outputs (fanning out of the bowtie). These architectures thus manage a wide range of inputs through a ''core'' (knot) constituted by a limited number of elements. In such structures, inputs are conveyed into a sort of funnel, t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Krishna Bharat
Krishna Bharat (born 7 January 1970) is an Indian research scientist at Google Inc. He was formerly a founding adviser for Grokstyle Inc. a visual search company and Laserlike Inc., an interest search engine startup based on Machine learning, Machine Learning. At Google, Mountain View, California, Mountain View, he led a team developing Google News, a service that automatically indexes over 25,000 news websites in more than 35 languages to provide a summary of the News resources. He created Google News in the aftermath of the September 11, 2001 attacks to keep himself abreast of the developments. Since then, it has been a popular offering from Google's services. Google News was one of Google's first endeavors beyond offering just plain text searches on its page. Among other projects, he opened the Google India's Research and Development center at Bengaluru, India. Bharat is on the Board of Visitors of Columbia University Graduate School of Journalism, Columbia Journalism School ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martín Abadi
Martín Abadi (born 1963) is an Argentine computer scientist, working at Google . He earned his Doctor of Philosophy (PhD) in computer science from Stanford University in 1987 as a student of Zohar Manna. He is well known for his work on computer security and on programming languages, including his paper (with Michael Burrows and Roger Needham) on the ''Burrows–Abadi–Needham logic'' for analyzing authentication protocols, and his book (with Luca Cardelli) ''A Theory of Objects'', laying out formal calculi for the semantics of object-oriented programming languages. In 1993, he published the programming language Baby Modula-3, a safe subset or sublanguage of Modula-3, based on functional programming and set theory ideals. Abadi is a core developer for the machine learning framework Tensorflow. He is a 2008 Fellow of the Association for Computing Machinery. In 2011, he was a temporary professor at the Collège de France in Paris, teaching computer security. He was elect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CAPTCHA
A CAPTCHA ( , a contrived acronym for "Completely Automated Public Turing test to tell Computers and Humans Apart") is a type of challenge–response test used in computing to determine whether the user is human. The term was coined in 2003 by Luis von Ahn, Manuel Blum, Nicholas J. Hopper, and John Langford. The most common type of CAPTCHA (displayed as Version 1.0) was first invented in 1997 by two groups working in parallel. This form of CAPTCHA requires entering a sequence of letters or numbers in a distorted image. Because the test is administered by a computer, in contrast to the standard Turing test that is administered by a human, a CAPTCHA is sometimes described as a reverse Turing test.This test has received many criticisms, from people with disabilities, but also many websites use it to prevent bot spamming and raiding, and it works effectively, and its usage is widespread. Most websites use hCaptcha or reCAPTCHA. It takes the average person approximately 10 seconds ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
