We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried and the responses to queries are faulty with a xed probability. We show that if f can be represented in k-DNF form and in j-CNF form, then O(n log(min(k; j)=q)) queries suuce to compute f with error probability less than q, ...

Tue aim of this paper is to find a fonnalism of the TAG family, where the derivation controller can be interpreted as a semantic dependency graph, in the sense of Meaning-Text Theory (ZM67; M88). In a previous paper (CK98), we study tliis interpretation of the derivation tree (DT) in the case of standard TAG. We prove that, in the general case, if the predieate-argument cooccurence principle1 [...

Tree form is a low-level, architecture-independent intermediate representation (IR) used by the Flex java-to-hardware compiler. Using a tree-based IR allows for the automatic construction of high-quality code generators for a substantial set of computer architectures, from only the precise specification of these architectures. This paper provides a thorough description of Tree form: its constru...