Sign In

Communications of the ACM

Research Archive


Archives

The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

November 2011


From Communications of the ACM

Technical Perspective: A Perfect 'Match'

In a breakthrough contribution, the authors of the paper that follows have developed an efficient way to find approximate nearest neighbors for the case of database patches within…


From Communications of the ACM

The PatchMatch Randomized Matching Algorithm for Image Manipulation

The PatchMatch Randomized Matching Algorithm for Image Manipulation

This paper presents a new randomized algorithm for quickly finding approximate nearest neighbor matches between image patches. Our algorithm offers substantial performance improvements over the previous state of the art. 


From Communications of the ACM

Making Information Flow Explicit in HiStar

Making Information Flow Explicit in HiStar

Features of the new HiStar operating system permit several novel applications, including privacy-preserving, untrusted virus scanners and a dynamic Web server with only a few thousand lines of trusted code.


From Communications of the ACM

Technical Perspective: Making Untrusted Code Useful

The following paper combines two important themes in secure computing: assurance and information flow control. For high assurance, a system's Trusted Computing Base needs to be small and the policy simple. Flow control is…

Read CACM in a free mobile app!
Access the latest issue, plus archived issues and more
ACM Logo
  • ACM CACM apps available for iPad, iPhone and iPod Touch, and Android platforms
  • ACM Digital Library apps available for iOS, Android, and Windows devices
  • Download an app and sign in to it with your ACM Web Account
Find the app for your mobile device
ACM DL Logo