Sciweavers

1510 search results - page 163 / 302
» Upper Probabilities and Additivity
Sort
View
PE
2000
Springer
118views Optimization» more  PE 2000»
15 years 3 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
129
Voted
CORR
1999
Springer
71views Education» more  CORR 1999»
15 years 3 months ago
New Error Bounds for Solomonoff Prediction
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when i...
Marcus Hutter
TCOM
2008
105views more  TCOM 2008»
15 years 3 months ago
Source fidelity over fading channels: performance of erasure and scalable codes
We consider the transmission of a Gaussian source through a block fading channel. Assuming each block is decoded independently, the received distortion depends on the tradeoff betw...
Konstantinos E. Zachariadis, Michael L. Honig, Agg...
IANDC
2010
116views more  IANDC 2010»
15 years 2 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
TKDE
2010
251views more  TKDE 2010»
15 years 2 months ago
Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index
—We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises...
Ben Kao, Sau Dan Lee, Foris K. F. Lee, David Wai-L...