14 results on '"Vardi, Moshe Y."'
Search Results
2. The Paradox of Choice in Computing-Research Conferences.
- Author
-
Vardi, Moshe Y.
- Subjects
- *
CONFERENCES & conventions , *COMPUTER science , *SOCIAL choice , *COVID-19 pandemic - Abstract
The author discusses his thoughts concerning the concept of over-choice in the availability of computing-research conferences. He examines the plethora of conferences and conventions available to computer science professionals, particularly amid the COVID-19 pandemic, and argues in favor of change in the computing-research publication system and community building.
- Published
- 2021
- Full Text
- View/download PDF
3. CACM: PAST, PRESENT, AND FUTURE.
- Author
-
Vardi, Moshe Y.
- Subjects
- *
PERIODICALS , *PUBLISHED articles , *PUBLIC opinion , *COMPUTER science - Abstract
The article discusses plans for the periodical "Communications of the Association for Computing Machinery" (CACM). By 2005 dissatisfaction with CACM had been felt within the computing community. In 2006 the author was appointed to oversee an overhaul of CACM. Through interacting with computing professionals he learned that there was still strong demand for a printed copy of the journal. Readers also wanted more research content, a livelier editorial page, and better graphic design. In addition to these changes, CACM will present more in-depth coverage of news, and will continue to publish refereed articles.
- Published
- 2008
- Full Text
- View/download PDF
4. Would Turing Have Won the Turing Award?
- Author
-
Vardi, Moshe Y.
- Subjects
- *
ACM A.M. Turing Award , *COMPUTER science awards , *LECTURES & lecturing , *COMPUTER science , *TURING machines , *HISTORY - Abstract
The article discusses the history of the Association for Computing Machinery (ACM) A. M. Turing Award in relation to the career of computer scientist Alan Turing. Topics include the beginning of the award as a lectureship, claims that Turing invented the computer in relation to his work as a mathematician, and the notion of a Universal Turing Machine.
- Published
- 2017
- Full Text
- View/download PDF
5. Why Doesn’t ACM Have a SIG for Theoretical Computer Science?
- Author
-
Vardi, Moshe Y.
- Subjects
- *
COMPUTER science , *MATHEMATICS , *COMPUTER systems , *CONFERENCES & conventions - Abstract
The article explores the difference between theoretical computer science (TCS) in North America and Europe. TCS is defined as the division of general computer science and mathematics that focuses on more abstract or mathematical aspects of computing. The author highlights the broadening scope of TCS and the broadening gap between the narrow focus of the IEEE Symposium on Foundations of Computer Science (FOCS) and the ACM Symposium on Theory of Computing (STOC).
- Published
- 2015
- Full Text
- View/download PDF
6. Incentivizing Quality and Impact in Computing Research.
- Author
-
Vardi, Moshe Y.
- Subjects
- *
COMPUTER science research , *SCHOLARLY publishing , *COMPUTER science education , *COMPUTER science , *ACADEMIC tenure , *SOCIETIES - Abstract
The article discusses publication culture within the field of computing research. Particular focus is given to a memo on the topic of evaluating computing scholarship by Batya Friedman and Fred B. Schneider, published by the Computing Research Association (CRA). The memo suggests that research organizations should focus on research quality and impact and dissuades administrators from emphasizing quantity of publications when making decisions about hiring, tenure, and promotion.
- Published
- 2015
- Full Text
- View/download PDF
7. Fricative Computing.
- Author
-
Vardi, Moshe Y.
- Subjects
- *
TELEMATICS , *COMPUTER science , *HIGH-frequency trading (Securities) , *EMAIL , *FINANCIAL crises - Abstract
The author reflects on frictionless computing, or the elimination of delay in computer-based communication, stating that some small amount of friction is necessary in computer science. He notes that high-frequency stock trading, conducted by algorithms and software, was cited as a stock market crash on May 6, 2010 and suggests this demonstrates the need for friction. In addition, he argues that too many emails are sent daily, decreasing their value.
- Published
- 2013
- Full Text
- View/download PDF
8. Who Begat Computing?
- Author
-
Vardi, Moshe Y.
- Subjects
- *
COMPUTER scientists , *COMPUTER science , *COMPUTER engineering , *COMPUTABLE functions , *ARTIFICIAL intelligence , *TURING test , *COMPUTER programming , *HISTORY - Abstract
The article presents the author's comments on the global social phenomena in celebration of centennial anniversary of the birth of the mathematician and computer scientist Alan Turing, one of the founding figures in computer engineering. Topics include Turing's accomplishments in the development of cryptoanalysis and the Turing Test for artificial intelligence (AI); preceding studies of computability upon which Turing built his work; and collective efforts in the creation of computer science.
- Published
- 2013
- Full Text
- View/download PDF
9. Is Moore's Party over?
- Author
-
Vardi, Moshe Y.
- Subjects
- *
SEMICONDUCTORS , *COMPUTER architecture , *ENERGY consumption , *ELECTRONIC circuits , *INTEGRATED circuits , *MICROPROCESSORS , *COMPUTER science , *COMPUTER industry - Abstract
The author offers opinions on computer science. It is argued that Moore's Law, the 1965 prediction that transistor density on integrated circuits could and would be exponentially increased does not necessarily translate into a subsequent exponential increase in microprocessor speed and performance, although the computer industry has in fact generated such increases since that time. Research indicating that the energy use of integrated circuits will become a barrier to continued improvement in microprocessor performance is cited in support of that contention.
- Published
- 2011
- Full Text
- View/download PDF
10. Are You Talking to Me?
- Author
-
Vardi, Moshe Y.
- Subjects
- *
PUBLIC speaking , *CONFERENCES & conventions , *COMPUTER science , *COMPUTER scientists , *VIDEO recording - Abstract
The author discusses the problem of poor presentations at computer science conferences. He describes some common mistakes, such as trying to read the entire contents of a research paper out loud to an audience, and recommends that speakers practice with a video recorder. He also notes that presentation quality could be made a criterion for acceptance to a conference program.
- Published
- 2011
- Full Text
- View/download PDF
11. Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions.
- Author
-
Kyrillidis, Anastasios, Shrivastava, Anshumali, Vardi, Moshe Y., and Zhang, Zhiwei
- Subjects
- *
COMPUTER science , *BOOLEAN functions , *FOURIER analysis , *POLYNOMIALS - Abstract
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side—especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT solvers—has been remarkable. Yet, while SAT solvers, aimed at solving industrial-scale benchmarks in Conjunctive Normal Form (CNF), have become quite mature, SAT solvers that are effective on other types of constraints (e.g., cardinality constraints and XORs) are less well-studied; a general approach to handling non-CNF constraints is still lacking. To address the issue above, we design FourierSAT,1 an incomplete SAT solver based on Fourier Analysis (also known as Walsh-Fourier Transform) of Boolean functions, a technique to represent Boolean functions by multilinear polynomials. By such a reduction to continuous optimization, we propose an algebraic framework for solving systems consisting of different types of constraints. The idea is to leverage gradient information to guide the search process in the direction of local improvements. We show this reduction enjoys interesting theoretical properties. Empirical results demonstrate that FourierSAT can be a useful complement to other solvers on certain classes of benchmarks. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
12. Special issue on SR 2013.
- Author
-
Mogavero, Fabio, Murano, Aniello, and Vardi, Moshe Y.
- Subjects
- *
COMPUTER science , *REASONING , *ACQUISITION of data , *PROBLEM solving , *INFORMATION technology security , *ROBOTS - Published
- 2015
- Full Text
- View/download PDF
13. View-based query processing: On the relationship between rewriting, answering and losslessness
- Author
-
Calvanese, Diego, De Giacomo, Giuseppe, Lenzerini, Maurizio, and Vardi, Moshe Y.
- Subjects
- *
QUERY languages (Computer science) , *DATABASES , *MACHINE theory , *COMPUTER science , *PROGRAMMING languages , *ELECTRONIC information resources , *ROBOTS - Abstract
Abstract: As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases consistent with the views. Rewriting consists in first reformulating the query in terms of the views and then evaluating the rewriting over the view extensions. Losslessness holds if we can answer the query by solely relying on the content of the views. While the mutual relationship between these three notions is easy to identify in the case of conjunctive queries, the terrain of notions gets considerably more complicated going beyond such a query class. In this paper, we revisit the notions of answering, rewriting, and losslessness and clarify their relationship in the setting of semistructured databases, and in particular for the basic query class in this setting, i.e., two-way regular path queries. Our first result is a clean explanation of the relationship between answering and rewriting, in which we characterize rewriting as a “linear approximation” of query answering. We show that applying this linear approximation to the constraint-satisfaction framework yields an elegant automata-theoretic approach to query rewriting. As for losslessness, we show that there are indeed two distinct interpretations for this notion, namely with respect to answering, and with respect to rewriting. We also show that the constraint-theoretic approach and the automata-theoretic approach can be combined to give algorithmic characterization of the various facets of losslessness. Finally, we deal with the problem of coping with loss, by considering mechanisms aimed at explaining lossiness to the user. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
14. In Memoriam.
- Author
-
Abiteboul, Serge, Kuper, Gabriel M., Mairson, Harry G., Shvartsman, Alexander A., and Vardi, Moshe Y.
- Subjects
- *
COMPUTER science , *SCIENTISTS , *CONSTRAINT databases , *DATABASES , *RESEARCH - Abstract
Authors of this article have mourned the passing of a creative and thoughtful colleague, Paris C. Kanellakis, who was respected for his many contributions, both technical and professional, to the computer science research community. In mourning Kanellakis' tragic death, his technical facility, his broad knowledge, his insight, his commitment and his humor are missed. To write a research paper with Kanellakis was also an opportunity to observe his indefatigable attention to detail and to engage in vigorous debate with his editorial voice. To his technical ability in solving problems, Kanellakis added a mature editorial voice. These authors have taken this opportunity to present some of Kanellakis' contributions to database theory, including deductive, object-oriented and constraint databases, as well as his work in fault-tolerant distributed computation and in type theory. In each of these areas, they have recognized Kanellakis' research contributions that were examples not merely of good problem solving, but also of insightful problem formulation.
- Published
- 1996
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.