A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxelsN. The algorithm, which is… (More)

We investigate the query complexity of exact learning in the membership and (proper) equivalence query model. We give a complete characterization of concept classes that are learnable with a… (More)

We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We de3ne consistent answers to such queries to be greatest-lowest/leastupper bounds… (More)

We introduce a new definition of efficient algorithms for restricted domains. Under this definition, an algorithm is required to be “robust,” i.e., it must produce correct output regardless of… (More)

Bshouty, Goldman, Hancock and Matar have shown that up to <inline-equation> <f> <rad><rcd>log<it>n<rm></rm></it></rcd></rad></f> </inline-equation>-term DNF formulas can be properly learned in the… (More)

(MATH) We show the following: <ol> <li>For any ε ρ 0, (log n)<sup>(3 + ε)</sup>-term DNF cannot be polynomial-query learned with membership and strongly proper equivalence queries.</li> <li>For any… (More)