A crucial issue in the design of very large disk arrays is the protection of data against catastrophic disk failures. Although today single disks are highly reliable, when a disk array consists ofâ€¦ (More)

A read-once formula is a Boolean formula in which each variable occurs, at most, once. Such formulas are also called Î¼-formulas or Boolean trees. This paper treats the problem of exactly identifyingâ€¦ (More)

A read-once formula is one in which each variable appears on at most a single input. Angluin, Hellerstein, and Karpinski give a polynomial time algorithm that uses membership and equivalence queriesâ€¦ (More)

The ever increasing need for I/O bandwidth will be met with ever larger arrays of disks. These arrays require redundancy to protect against data loss. This paper examines alternative choices forâ€¦ (More)

We consider the problem of learning in the presence of irrelevant attributes in Valiant's PAC model V84]. In the PAC model, the goal of the learner is to produce an approximately correct hypothesisâ€¦ (More)

This paper addresses the problem of learning boolean functions in query and mistake-bound models in the presence of irrelevant attributes. In learning a concept, a learner may observe a great manyâ€¦ (More)

For circuit classes R, the fundamental computational problem Min-R asks for the minimum R-size of a Boolean function presented as a truth table. Prominent examples of this problem include Min-DNF,â€¦ (More)