We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
All positive examples are alike; each negative example is negative in its own way. During interactive multimedia information retrieval, the number of training samples fed-back by ...
Using ε-bias spaces over F2, we show that the Remote Point Problem (RPP), introduced by Alon et al [APY09], has an NC2 algorithm (achieving the same parameters as [APY09]). We stu...
Invariant features or operators are often used to shield the recognition process from the effect of "nuisance" parameters, such as rotations, foreshortening, or illumina...