Sciweavers

143 search results - page 12 / 29
» Bisimulation for Labelled Markov Processes
Sort
View
QEST
2010
IEEE
13 years 5 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...
FOSSACS
2005
Springer
14 years 1 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
ICMCS
2009
IEEE
415views Multimedia» more  ICMCS 2009»
13 years 5 months ago
A new localized superpixel Markov random field for image segmentation
In this paper, we present a novel localized Markov random field (MRF) method based on superpixels for region segmentation. Early vision problems could be formulated as pixel label...
Xiaofeng Wang, Xiao-Ping Zhang
VMCAI
2010
Springer
14 years 4 months ago
Advances in Probabilistic Model Checking
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
Joost-Pieter Katoen
PAMI
2010
215views more  PAMI 2010»
13 years 6 months ago
Fusion Moves for Markov Random Field Optimization
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
Victor S. Lempitsky, Carsten Rother, Stefan Roth, ...