1830 search results - page 250 / 366 » Workshop on Graph Computation Models |
151
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
123
click to vote
COLING
2010
15 years 1 days ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
161
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
157
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
145
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...