1940 search results - page 129 / 388 » Graph Transformation with Variables |
153
Voted
MICCAI
2010
Springer
15 years 1 months ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
129
Voted
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
143
click to vote
DM
2008
15 years 3 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
123
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
134
click to vote
DLT
2004
15 years 4 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...