4255 search results - page 439 / 851 » On Learning Boolean Functions |
180
click to vote
CC
2008
Springer
15 years 6 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
153
click to vote
ECCC
2007
15 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
155
click to vote
PAMI
2008
15 years 6 months ago
2008
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
188
click to vote
IJFCS
2007
15 years 6 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
196
click to vote
JEI
2000
15 years 6 months ago
2000
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...