1449 search results - page 220 / 290 » Self-Randomized Exponentiation Algorithms |
173
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
148
click to vote
SCALESPACE
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. In recent years, the use of multimedia content has experienced an exponential growth. In this context, the need of new image/video sequence representation is becoming a n...
168
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
198
click to vote
AMFG
2007
IEEE
15 years 10 months ago
2007
IEEE
A key problem for "face in the crowd" recognition from existing surveillance cameras in public spaces (such as mass transit centres) is the issue of pose mismatches betwe...
170
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...