Communications of the ACM

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Social influence and end-user training
Communications of the ACM - Tập 38 Số 7 - Trang 70-79 - 1995
Dennis F. Galletta, Manju Ahuja, Amir Hartman, Thompson S.H. Teo, A. Graham Peace
An efficient context-free parsing algorithm
Communications of the ACM - Tập 13 Số 2 - Trang 94-102 - 1970
Jay Earley
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR( k ) algorithm and the familiar top-down algorithm. It has a time bound proportional to n 3 (where n is the length of the string being parsed) in general; it has an n 2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, w... hiện toàn bộ
Big data and its technical challenges
Communications of the ACM - Tập 57 Số 7 - Trang 86-94 - 2014
H. V. Jagadish, Johannes Gehrke, Alexandros Labrinidis, Yannis Papakonstantinou, Jignesh M. Patel, Raghu Ramakrishnan, Cyrus Shahabi
Exploring the inherent technical challenges in realizing the potential of Big Data.
Computational thinking
Communications of the ACM - Tập 49 Số 3 - Trang 33-35 - 2006
Jeannette M. Wing
It represents a universally applicable attitude and skill set everyone, not just computer scientists, would be eager to learn and use.
Do we really need computational thinking?
Communications of the ACM - Tập 62 Số 2 - Trang 32-35 - 2019
Enrico Nardelli
Considering the expression "computational thinking" as an entry point to understand why the fundamental contribution of computing to science is the shift from solving problems to having problems solved.
Algorithm 112: Position of point relative to polygon
Communications of the ACM - Tập 5 Số 8 - Trang 434 - 1962
M. Shimrat
A theory of the learnable
Communications of the ACM - Tập 27 Số 11 - Trang 1134-1142 - 1984
Leslie G. Valiant
An axiomatic basis for computer programming
Communications of the ACM - Tập 12 Số 10 - Trang 576-580 - 1969
C. A. R. Hoare
In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms a... hiện toàn bộ
How traditional firms must compete in the sharing economy
Communications of the ACM - Tập 58 Số 1 - Trang 32-34 - 2015
Michael A. Cusumano
Considering the evolving relationship between established companies and their sharing-economy counterparts.
Data completeness
Communications of the ACM - Tập 46 Số 6 - Trang 47-51 - 2003
M. Kathryn Brohman, Richard T. Watson, Gabriele Piccoli, A. Parasurama
To gain and maintain customer loyalty, a firm must learn how to best translate and mine the data they have on those customers.
Tổng số: 155   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10