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 ...... 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
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.
Faster methods for random sampling
Communications of the ACM - Tập 27 Số 7 - Trang 703-718 - 1984
Jeffrey Scott Vitter
Several new methods are presented for selecting n records at random without replacement from a file containing N records. Each algorithm selects the records for the sample in a sequential manner—in the same order the records appear in the file. The algorithms are online in that the records for the sample are selected iteratively with no preprocessing. The algorith...... hiện toàn bộ
Evaluation of strategic investments in information technology
Communications of the ACM - Tập 34 Số 1 - Trang 22-36 - 1991
Eric K. Clemons
SQL databases v. NoSQL databases
Communications of the ACM - Tập 53 Số 4 - Trang 10-11 - 2010
Michael Stonebraker
The Communications Web site, http://cacm.acm.org, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications , we'll publish excerpts from selected posts. twitter Follow us on Twitter at http://twitter.com/blogCACM... hiện toàn bộ
Tổng số: 155   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10