And–or tree

Automatic algorithm configurators are important practical tools for improving program performance measures, such as solution time… Expand

We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials… Expand

The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several… Expand

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

In this paper, we introduce non-uniform compressive sensing (NCS), a novel compressive sensing (CS) technique that enables non… Expand

This paper investigates the applicability of Genetic Programming type systems to dynamic game environments. Grammatical Evolution… Expand

We present a bounded-error quantum algorithm for evaluating Min - Max trees with $N^{\frac{1}{2}+o(1)}$ queries, where N is the… Expand

Logic Programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very… Expand

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

This paper studies tail bounds on supercritical branching processes with nite distributions of oospring. Given a nite… Expand