And–or tree

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f within 1=3 at every… (More)

This paper presents a method of learning reconfigurable And-Or Tree (AOT) models discriminatively from weakly annotated data for… (More)

A natural scene is composed of many components. See the example of the scene of beach in Figure 2. When we look at this image… (More)

This paper proposes a simple yet effective method to learn the hierarchical object shape model consisting of local contour… (More)

Many tasks require evaluating a specified Boolean expression over a set of probabilistic tests whose costs and success… (More)

We consider two probability distributions on Boolean functions defined in terms of their representations by and/or trees (or… (More)

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric… (More)

Many tasks require evaluating a specified boolean expression φ over a set of probabilistic tests where we know the probability… (More)

We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools… (More)

Independent and-parallelism, dependent and-parallelism and or-parallelism are the three main forms of implicit parallelism… (More)