2168 search results - page 223 / 434 » Randomized Algorithms and Complexity Theory |
220
click to vote
TOMACS
2011
14 years 10 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
125
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
113
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
120
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
141
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
This study reports the work to date on the analysis of different methodologies for constant creation with the aim of applying the most advantageous method to the dynamic real wor...