Tracing the tangled web of unsolicited and undesired email and possible strategies for its demise.
Systems and Networking
Advertisement
Heavy Hitters via Cluster-Preserving Clustering
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of size n using the same asymptotic O(k log n) words of memory and O(log n) update time as the COUNTMIN and COUNTSKETCH, but requiring only O(k poly(log n)) time to answer queries instead of the O(n log n) time of the other two. The notion of "approximation" is the same l2 sense as the COUNTSKETCH, which given known lower bounds is the strongest guarantee one can achieve in sublinear memory. Our main innovation is an efficient reduction from the heavy hitters problem to a clustering problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a graph, and the goal is to identify every cluster.
Technical Perspective: The True Cost of Popularity
The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective search process.
In trying to "drown" the opposition with daily online elections, I didn't realize they could wash me away.
The Drive to Quantum Computing
The U.S. National Quantum Initiative will support the push towards a quantum computing infrastructure, ecosystem, and workforce.
Researchers find a way to make many implanted medical devices virtually hack-proof.
Lazy Developers Are the Best Developers
Lazy developers stick to the project scope while forcing the project team to understand and fix their own code and issues.
This year is the 50th anniversary of the activation of the Arpanet project.
Good Algorithms Make Good Neighbors
Many computer scientists doubted ad hoc methods would ever give way to a more general approach to finding nearest neighbors. They were wrong.
A new framework is being used to secure the 2020 U.S. Census from database reconstruction attacks.
Access Controls and Healthcare Records: Who Owns the Data?
A discussion with David Evans, Richard McDonald, and Terry Coatta.
Used in the design of the Internet and Unix, the layered services of the hourglass model have enabled viral adoption and deployment scalability.
Internet of Things Search Engine
Tracing the complicated yet still relatively unripe area of the Internet of Things search engine—from concepts, to classification, and open issues.
There is a need for alternative techniques for understanding and evaluating QUIC when compared with previous transport-layer protocols.
Technical Perspective: Do You Know Why Your Web Pages Load Faster?
"Taking a Long Look at QUIC," by Arash Molavi Kakhki et al., is a bold attempt to unearth the reasons why QUIC works better than TCP.
Hazardous Enthusiasm and How Eagerness Can Kill A Project
Many otherwise competent software developers and potential contributors end up being overwhelmed by "hazardous enthusiasm." They end up overwhelmed by their excitement and instead of implementing gradual change, they try to redo entire projects. Let's take a look at what I mean.
Today's facial recognition tools raise new questions about how, where, and when data can be used.
How Computation is Changing Journalism
Nicholas Diakopoulos has helped to make journalism is increasingly computational.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More