266 search results - page 8 / 54 » On the variance of random polygons |
COCOON
2001
Springer
15 years 4 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
87
Voted
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Invariant features or operators are often used to shield the recognition process from the effect of "nuisance" parameters, such as rotations, foreshortening, or illumina...
COLT
2000
Springer
15 years 4 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...
104
Voted
BMCBI
2006
14 years 11 months ago
2006
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
JACM
2011
14 years 6 months ago
2011
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...