47 search results - page 3 / 10 » On Bounding Problems of Quantitative Information Flow |
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
ECCV
2008
Springer
14 years 7 months ago
2008
Springer
Segmentation has gained in popularity in stereo matching. However, it is not trivial to incorporate it in optical flow estimation due to the possible non-rigid motion problem. In t...
NETWORKS
2010
13 years 3 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...