2168 search results - page 9 / 434 » Randomized Algorithms and Complexity Theory |
COCO
1995
Springer
15 years 3 months ago
1995
Springer
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
ICML
1999
IEEE
16 years 10 days ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...