568 search results - page 49 / 114 » New bounds for the Cebysev functional |
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
ICHIM
2001
13 years 9 months ago
2001
The "Institut National de I'Audiovisuel" (1NA) is in charge of keeping records of national TV broadcasts. Its main function is to provide TV producers with authenti...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
GECCO
2009
Springer
14 years 9 days ago
2009
Springer
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...