|
Dana Ron
Dana Ron Goldreich ( he, דנה רון גולדרייך; b. 1964) is a computer scientist, a professor of electrical engineering at the Tel Aviv University, Israel. Prof. Ron is one of the pioneers of research in property testing, and a leading researcher in that area. Professional career Dana Ron obtained her B.A. (1987) and M.A. (1989) in computer science from the Hebrew University in Jerusalem. Her Ph.D. (1995), also from the Hebrew University, was in the area of machine learning. Between the years 1995-97 she was an NSF post-doctoral fellow at the Massachusetts Institute of Technology (MIT). She was a Bunting fellow in 1997/8, and the Radcliffe fellow at Harvard University in 2003/4. Her research interests include sublinear-time algorithms (in particular property testing), randomized algorithms, and computational learning theory. She is married to Oded Goldreich, who is also a computer scientist at the Weizmann Institute, and has collaborated with Goldreich on approximation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Israel
Israel (; he, יִשְׂרָאֵל, ; ar, إِسْرَائِيل, ), officially the State of Israel ( he, מְדִינַת יִשְׂרָאֵל, label=none, translit=Medīnat Yīsrāʾēl; ), is a country in Western Asia. It is situated on the southeastern shore of the Mediterranean Sea and the northern shore of the Red Sea, and shares borders with Lebanon to the north, Syria to the northeast, Jordan to the east, and Egypt to the southwest. Israel also is bordered by the Palestinian territories of the West Bank and the Gaza Strip to the east and west, respectively. Tel Aviv is the economic and technological center of the country, while its seat of government is in its proclaimed capital of Jerusalem, although Israeli sovereignty over East Jerusalem is unrecognized internationally. The land held by present-day Israel witnessed some of the earliest human occupations outside Africa and was among the earliest known sites of agriculture. It was inhabited by the Canaanites ... [...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] |
Theoretical Computer Scientists
A theory is a rational type of abstract thinking about a phenomenon, or the results of such thinking. The process of contemplative and rational thinking is often associated with such processes as observational study or research. Theories may be scientific, belong to a non-scientific discipline, or no discipline at all. Depending on the context, a theory's assertions might, for example, include generalized explanations of how nature works. The word has its roots in ancient Greek, but in modern use it has taken on several related meanings. In modern science, the term "theory" refers to scientific theories, a well-confirmed type of explanation of nature, made in a way consistent with the scientific method, and fulfilling the criteria required by modern science. Such theories are described in such a way that scientific tests should be able to provide empirical support for it, or empirical contradiction ("falsify") of it. Scientific theories are the most reliable, rigorous, and compr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Israeli Computer Scientists
Israeli may refer to: * Something of, from, or related to the State of Israel * Israelis, citizens or permanent residents of the State of Israel * Modern Hebrew, a language * ''Israeli'' (newspaper), published from 2006 to 2008 * Guni Israeli (born 1984), Israeli basketball player See also * Israelites, the ancient people of the Land of Israel * List of Israelis Israelis ( he, ישראלים ''Yiśraʾelim'') are the citizens or permanent residents of the State of Israel, a multiethnic state populated by people of different ethnic backgrounds. The largest ethnic groups in Israel are Jews (75%), foll ... {{disambiguation Language and nationality disambiguation pages ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1964 Births
Events January * January 1 – The Federation of Rhodesia and Nyasaland is dissolved. * January 5 - In the first meeting between leaders of the Roman Catholic and Orthodox churches since the fifteenth century, Pope Paul VI and Patriarch Athenagoras I of Constantinople meet in Jerusalem. * January 6 – A British firm, the Leyland Motor Corp., announces the sale of 450 buses to the Cuban government, challenging the United States blockade of Cuba. * January 9 – ''Martyrs' Day'': Armed clashes between United States troops and Panamanian civilians in the Panama Canal Zone precipitate a major international crisis, resulting in the deaths of 21 Panamanians and 4 U.S. soldiers. * January 11 – United States Surgeon General Luther Terry reports that smoking may be hazardous to one's health (the first such statement from the U.S. government). * January 12 ** Zanzibar Revolution: The predominantly Arab government of Zanzibar is overthrown by African nationalist rebels; a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michal Parnas
Michal Parnas ( he, מיכל פרנס) is an Israeli theoretical computer scientist known for her work on property testing and sublinear-time algorithms. She is a professor of computer science at the Academic College of Tel Aviv-Yafo in Israel, where she was a founding faculty member and was also the dean of the school of computer science from 2011 to 2016. Since October 2022 she is the vice president of academic affairs of the college. Parnas is the daughter of neurobiologist (1935–2012). She was a master's student at the Hebrew University of Jerusalem, working with Avi Wigderson on a 1990 master's thesis on ''Approximate Counting, Almost Uniform Generation and Random Walks''. She completed her Ph.D. at the Hebrew University in 1994. Her dissertation, ''Robust Algorithms and Data Structures for Information Retrieval'', was jointly supervised by Danny Dolev and Noam Nisan. She is the co-author of a book in Hebrew on discrete mathematics Discrete mathematics is the study o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Approximation Algorithm
In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time. The field of approximation algorithms, therefore, tries to understand how closely it is possible to approximate optimal solutions to such problems in polynomial time. In an overwhelming majority of the cases, the guarantee of such algorithms is a multiplicative one expressed as an approximation ratio or approximation factor i.e., the optimal solution is always guaranteed to be within a (predetermined) multiplicative factor of the returned solution. However, there are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weizmann Institute
The Weizmann Institute of Science ( he, מכון ויצמן למדע ''Machon Vaitzman LeMada'') is a public research university in Rehovot, Israel, established in 1934, 14 years before the State of Israel. It differs from other Israeli universities in that it offers only postgraduate degrees in the natural and exact sciences. It is a multidisciplinary research center, with around 3,800 scientists, postdoctoral fellows, Ph.D. and M.Sc. students, and scientific, technical, and administrative staff working at the institute. As of 2019, six Nobel laureates and three Turing Award winners have been associated with the Weizmann Institute of Science. History Founded in 1934 by Chaim Weizmann and his first team, among them Benjamin M. Bloch, as the Daniel Sieff Research Institute. Weizmann had offered the post of director to Nobel Prize laureate Fritz Haber, but took over the directorship himself after Haber's death en route to Palestine. Before he became President of the State ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oded Goldreich
Oded Goldreich ( he, עודד גולדרייך; b. 1957) is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017 and was selected in 2021 to receive the Israel Prize in mathematics. Biography Goldreich received a DSc in Computer Science at Technion in 1983 under Shimon Even. Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing,Oded Goldreich, Shafi Goldwasser, and Dana Ron. 1998 Property Testing and its connection to Learning and Approximation. ''Journal of the ACM'', pages 653-750. and other areas in cryptography and computational complexity. Goldreich has also authored several books including: ''Fou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Learning Theory
In computer science, computational learning theory (or just learning theory) is a subfield of artificial intelligence devoted to studying the design and analysis of machine learning algorithms. Overview Theoretical results in machine learning mainly deal with a type of inductive learning called supervised learning. In supervised learning, an algorithm is given samples that are labeled in some useful way. For example, the samples might be descriptions of mushrooms, and the labels could be whether or not the mushrooms are edible. The algorithm takes these previously labeled samples and uses them to induce a classifier. This classifier is a function that assigns labels to samples, including samples that have not been seen previously by the algorithm. The goal of the supervised learning algorithm is to optimize some measure of performance such as minimizing the number of mistakes made on new samples. In addition to performance bounds, computational learning theory studies the t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can perform automated deductions (referred to as automated reasoning) and use mathematical and logical tests to divert the code execution through various routes (referred to as automated decision-making). Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus". In contrast, a Heuristic (computer science), heuristic is an approach to problem solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result. As an effective method, an algorithm ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
