Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian ļ¬ltering. This family of algorithms includes bilateral ļ¬...
A revision algorithm is a learning algorithm that identiļ¬es the target concept, starting from an initial concept. Such an algorithm is considered eļ¬cient if its complexity (in ...