Sciweavers

1612 search results - page 133 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection
—It has been of significant importance to provision network-wide guaranteed QoS for a wide range of event detection applications in wireless sensor networks (WSNs). This paper in...
Yanmin Zhu, Lionel M. Ni
INFOCOM
2005
IEEE
15 years 10 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
15 years 10 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 3 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
INFOCOM
2007
IEEE
15 years 11 months ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai