December 2023 - Vol. 66 No. 12
Features
Opinion Cerf's Up
The role of ACM members, as professionals in the computing realm, makes them candidates for the provision of expert testimony in both criminal and civil judicial…
Comparing Chatbots Trained In Different Languages
Antony Chayka and Andrei Sukhov examine how training chatbots in English or Russian affects their responses.
Emulating the behavior of exotic quantum states may give quantum computing a better way of squeezing out troublesome noise and errors.
Saving Digital Libraries and the Internet Archive
A battle over “truth and who has access to it in the digital age.”
Revamping Python for an AI World
Mojo has the same syntax as Python, but runs up to 35,000 times faster.
Why Is the Current XAI Not Meeting the Expectations?
Seeking better explanations for how algorithmic decisions are made.
The much-sought holy grail of more and faster innovation will come from integrating pipeline thinking and adoption thinking.
Five Ways Executives Misunderstand Technology
How executives might better understand technology.
There Was No ‘First AI Winter’
Despite challenges and failures, the artificial intelligence community grew steadily during the 1970s.
Data Analytics Anywhere and Everywhere
Mobile, ubiquitous, and immersive computing appear poised to transform visualization, data science, and data-driven decision making.
Theoretical Analysis of Edit Distance Algorithms
To what extent have the techniques for theoretical analysis of edit distance algorithms achieved their goals?
Research and Advances Research
Understanding and handling interference across multiple active cameras.
Research and Advances December 2023
Maximum Flow Through a Network: A Storied Problem and a Groundbreaking Solution
“Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow,” by Li Chen et al., comes within striking distance of answering the question: “Does maximum…
Research and Advances Research Highlights
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and…
2023-2024 ACM Athena Lecturer Margo Seltzer recalls the motivations behind the development of the Berkeley DB database software library, and other achievements during her…