Sciweavers

239 search results - page 13 / 48
» Passage time distributions in large Markov chains
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 10 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
SSS
2009
Springer
15 years 4 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
TIP
2010
137views more  TIP 2010»
14 years 4 months ago
Adaptive Langevin Sampler for Separation of t-Distribution Modelled Astrophysical Maps
We propose to model the image differentials of astrophysical source maps by Student's t-distribution and to use them in the Bayesian source separation method as priors. We int...
Koray Kayabol, Ercan E. Kuruoglu, José Luis...
INFOCOM
2002
IEEE
15 years 2 months ago
Exact sampling of TCP Window States
We demonstrate how to apply Coupling from the Past, a simulation technique for exact sampling, to Markov chains based on TCP variants. This approach provides a new, statistically ...
Ashish Goel, Michael Mitzenmacher
NIPS
2001
14 years 11 months ago
Bayesian time series classification
This paper proposes an approach to classification of adjacent segments of a time series as being either of classes. We use a hierarchical model that consists of a feature extract...
Peter Sykacek, Stephen J. Roberts