Sciweavers

4007 search results - page 205 / 802
» Computation with imprecise probabilities
Sort
View
RTA
2005
Springer
15 years 9 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
ECCV
2004
Springer
15 years 9 months ago
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
Leo Grady, Gareth Funka-Lea
AINA
2003
IEEE
15 years 9 months ago
Analysis of Delayed Reservation Scheme in Server-Based QoS Management Network
This paper proposes an analytical model for delayed reservation scheme, which can be exactly analyzed. By applying it to a server-based QoS management network, we can obtain the r...
Takeshi Ikenaga, Kenji Kawahara, Tetsuya Takine, Y...
ACCV
2009
Springer
15 years 8 months ago
Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
129
Voted
STACS
2001
Springer
15 years 8 months ago
Small PCPs with Low Query Complexity
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
Prahladh Harsha, Madhu Sudan