|
Ravindran Kannan
Ravindran Kannan ( ta, ரவீந்திரன் கண்ணன்; born 12 March 1953, Madras) is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT, Carnegie Mellon University, CMU and Indian Institute of Science, IISc. The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) presented its 2011 Knuth Prize to Ravi Kannan for developing influential algorithmic techniques aimed at solving long-standing computational problems.Micro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Madras
Chennai (, ), formerly known as Madras ( the official name until 1996), is the capital city of Tamil Nadu, the southernmost Indian state. The largest city of the state in area and population, Chennai is located on the Coromandel Coast of the Bay of Bengal. According to the 2011 Indian census, Chennai is the sixth-most populous city in the country and forms the fourth-most populous urban agglomeration. The Greater Chennai Corporation is the civic body responsible for the city; it is the oldest city corporation of India, established in 1688—the second oldest in the world after London. The city of Chennai is coterminous with Chennai district, which together with the adjoining suburbs constitutes the Chennai Metropolitan Area, the List of urban areas by population, 36th-largest urban area in the world by population and one of the largest metropolitan economies of India. The traditional and de facto gateway of South India, Chennai is among the most-visited Indian cities by f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Randomized Algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performance in the "average case" over all possible choices of random determined by the random bits; thus either the running time, or the output (or both) are random variables. One has to distinguish between algorithms that use the random input so that they always terminate with the correct answer, but where the expected running time is finite (Las Vegas algorithms, for example Quicksort), and algorithms which have a chance of producing an incorrect result (Monte Carlo algorithms, for example the Monte Carlo algorithm for the MFAS problem) or fail to produce a result either by signaling a failure or failing to terminate. In some cases, probabilistic algorithms are the only practical means of solving a problem. In common practice, randomized algor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Avrim Blum
Avrim Blum (born 27 May 1966) is a computer scientist. In 2007, he was made a List of Fellows of the Association for Computing Machinery, Fellow of the Association for Computing Machinery "for contributions to learning theory and algorithms." Blum attended MIT, where he received his Doctor of Philosophy, Ph.D. in 1991 under professor Ron Rivest. He was a professor of computer science at Carnegie Mellon University from 1991 to 2017. In 2017, he joined Toyota Technological Institute at Chicago as professor and chief academic officer. His main work has been in the area of theoretical computer science, with particular activity in the fields of machine learning, computational learning theory, algorithmic game theory, database privacy, and algorithms. Avrim is the son of two other well-known computer scientists, Manuel Blum, 1995 Turing Award winner, and Lenore Blum. See also * Co-training References External links Videos of Avrim lecturing {{DEFAULTSORT:Blum, Avrim 1966 bi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alan M
Alan may refer to: People * Alan (surname), an English and Turkish surname * Alan (given name), an English given name **List of people with given name Alan ''Following are people commonly referred to solely by "Alan" or by a homonymous name.'' *Alan (Chinese singer) (born 1987), female Chinese singer of Tibetan ethnicity, active in both China and Japan *Alan (Mexican singer) (born 1973), Mexican singer and actor * Alan (wrestler) (born 1975), a.k.a. Gato Eveready, who wrestles in Asistencia Asesoría y Administración *Alan (footballer, born 1979) (Alan Osório da Costa Silva), Brazilian footballer *Alan (footballer, born 1998) (Alan Cardoso de Andrade), Brazilian footballer *Alan I, King of Brittany (died 907), "the Great" *Alan II, Duke of Brittany (c. 900–952) * Alan III, Duke of Brittany(997–1040) *Alan IV, Duke of Brittany (c. 1063–1119), a.k.a. Alan Fergant ("the Younger" in Breton language) *Alan of Tewkesbury, 12th century abbott *Alan of Lynn (c. 1348–1423), 15th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Szemerédi Regularity Lemma
Szemerédi's regularity lemma is one of the most powerful tools in extremal graph theory, particularly in the study of large dense graphs. It states that the vertices of every large enough graph can be partitioned into a bounded number of parts so that the edges between different parts behave almost randomly. According to the lemma, no matter how large a graph is, we can approximate it with the edge densities between a bounded number of parts. Between any two parts, the distribution of edges will be pseudorandom as per the edge density. These approximations provide essentially correct values for various properties of the graph, such as the number of embedded copies of a given subgraph or the number of edge deletions required to remove all copies of some subgraph. Statement To state Szemerédi's regularity lemma formally, we must formalize what the edge distribution between parts behaving 'almost randomly' really means. By 'almost random', we're referring to a notion called -regu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Communications Of The ACM
''Communications of the ACM'' is the monthly journal of the Association for Computing Machinery (ACM). It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are intended for readers with backgrounds in all areas of computer science and information systems. The focus is on the practical implications of advances in information technology and associated management issues; ACM also publishes a variety of more theoretical journals. The magazine straddles the boundary of a science magazine, trade magazine, and a scientific journal. While the content is subject to peer review, the articles published are often summaries of research that may also be published elsewhere. Material published must be accessible and relevant to a broad readership. From 1960 onward, ''CACM'' also published algorithms, expressed in ALGOL. The collection of algorithms later became known as the Collected Algorithms of the ACM. See also * ''Journal of the A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fellow Of The Association For Computing Machinery
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] |
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deals with finite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Annals Of Mathematics
The ''Annals of Mathematics'' is a mathematical journal published every two months by Princeton University and the Institute for Advanced Study. History The journal was established as ''The Analyst'' in 1874 and with Joel E. Hendricks as the founding editor-in-chief. It was "intended to afford a medium for the presentation and analysis of any and all questions of interest or importance in pure and applied Mathematics, embracing especially all new and interesting discoveries in theoretical and practical astronomy, mechanical philosophy, and engineering". It was published in Des Moines, Iowa, and was the earliest American mathematics journal to be published continuously for more than a year or two. This incarnation of the journal ceased publication after its tenth year, in 1883, giving as an explanation Hendricks' declining health, but Hendricks made arrangements to have it taken over by new management, and it was continued from March 1884 as the ''Annals of Mathematics''. The n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithmica
''Algorithmica'' received the highest possible ranking “A*”. External links Springer information Computer science journals Springer Science+Business Media academic journals Monthly journals Publications established in 1986 English-language journals ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Hopcroft
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella book) and data structures are regarded as standards in their fields. He is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, Co-Director of the Center on Frontiers of Computing Studies at Peking University, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University. Education He received his bachelor's degree from Seattle University in 1961. He received his master's degree and Ph.D. from Stanford University in 1962 and 1964, respectively. He worked for three years at Princeton University and since then has been at Cornell University. Hopcroft is the grandson of Jacob Nist, founder of the Seattle-Tacoma Box Company. Career In addition to his research work, he is well known for his books on algorithms and formal languages coauthored w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithmic Version For Szemerédi Regularity Partition
Algorithmic may refer to: *Algorithm, step-by-step instructions for a calculation **Algorithmic art, art made by an algorithm **Algorithmic composition, music made by an algorithm **Algorithmic trading, trading decisions made by an algorithm **Algorithmic patent, an intellectual property right in an algorithm *Algorithmics, the science of algorithms **''Algorithmica'', an academic journal for algorithm research **Algorithmic efficiency, the computational resources used by an algorithm **Algorithmic information theory, study of relationships between computation and information **Algorithmic mechanism design, the design of economic systems from an algorithmic point of view **Algorithmic number theory, algorithms for number-theoretic computation **Algorithmic game theory, game-theoretic techniques for algorithm design and analysis * Algorithmic cooling, a phenomenon in quantum computation *Algorithmic probability In algorithmic information theory, algorithmic probability, also known as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
