5115 search results - page 681 / 1023 » On Randomized Lanczos Algorithms |
183
click to vote
COLT
2001
Springer
15 years 11 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...
179
click to vote
COLT
2000
Springer
15 years 11 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
ICPPW
1999
IEEE
15 years 11 months ago
1999
IEEE
A new method for updating certificate revocation trees (CRT) is proposed. Efficient revocation of publickey certificates is a current issue in public-key Infrastructure because a ...
215
click to vote
EMMCVPR
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We propose a vector representation approach to contour estimation from noisy data. Images are modeled as random elds composed of a set of homogeneous regions contours (bo...
195
click to vote
RTCSA
1999
IEEE
15 years 11 months ago
1999
IEEE
A non-blocking protocol that allows real-time tasks to share data in a multiprocessor system is presented in this paper. The protocol gives the means to concurrent real-time tasks...