511 search results - page 28 / 103 » Lower bounds for distributed markov chain problems |
ECCC
2010
13 years 8 months ago
2010
We introduce a new approach to characterizing the unobserved portion of a distribution, which provides sublinear-sample additive estimators for a class of properties that includes...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...