2354 search results - page 141 / 471 » Randomness, Stochasticity and Approximations |
185
click to vote
MA
2011
Springer
14 years 11 months ago
2011
Springer
: By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals Fn ...
173
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
127
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
127
click to vote
COCO
2001
Springer
15 years 8 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
154
click to vote
IEICET
2010
15 years 1 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...