2354 search results - page 174 / 471 » Randomness, Stochasticity and Approximations |
137
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
153
Voted
AIPS
2009
15 years 5 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
129
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
—In energy harvesting communication systems, an exogenous recharge process supplies energy for the data transmission and arriving energy can be buffered in a battery before consu...
119
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
132
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...