We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...
This article describes our experience with test suites and automated branch coverage tools for APL software maintenance, based on our use of them to verify Y2K compliance of an AP...
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
Modern virtual machines, such as Java and Inferno, are emerging as network computing s. While these virtual machines provide higher-level abstractions and more sophisticated servi...