The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
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 image data.
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.
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.
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…