12194 search results - page 55 / 2439 » Numberings Optimal for Learning |
83
Voted
ICCV
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
145
Voted
LION
2009
Springer
15 years 7 months ago
2009
Springer
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
106
Voted
FSE
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
ECML
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
116
click to vote
EUROGP
2008
Springer
15 years 2 months ago
2008
Springer
Many automatically-synthesized programs have, like their hand-made counterparts, numerical parameters that need to be set properly before they can show an acceptable performance. H...