973 search results - page 75 / 195 » New Bounds on Crossing Numbers |
ML
2002
ACM
14 years 11 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
CRYPTO
1991
Springer
15 years 3 months ago
1991
Springer
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
EUROSYS
2010
ACM
15 years 4 months ago
2010
ACM
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
101
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
COLT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...