Sciweavers

2354 search results - page 174 / 471
» Randomness, Stochasticity and Approximations
Sort
View
EUROPAR
2009
Springer
14 years 4 months ago
Uniform Sampling for Directed P2P Networks
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....
Cyrus P. Hall, Antonio Carzaniga
AIPS
2009
13 years 10 months ago
Computing Robust Plans in Continuous Domains
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...
Christian Fritz, Sheila A. McIlraith
CORR
2010
Springer
254views Education» more  CORR 2010»
13 years 8 months ago
Information-Theoretic Analysis of an Energy Harvesting Communication System
—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...
Omur Ozel, Sennur Ulukus
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
14 years 1 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
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 ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
13 years 11 months ago
Sampling Hypersurfaces through Diffusion
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 ...
Hariharan Narayanan, Partha Niyogi