4171 search results - page 234 / 835 » Choice numbers of graphs |
209
click to vote
BMVC
2010
15 years 4 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
158
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
195
click to vote
AGTIVE
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. In this short paper we describe the setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on “Ap...
193
click to vote
GBRPR
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. We introduce a new framework for feature grouping based on factor graphs, which are graphical models that encode interactions among arbitrary numbers of random variables....
159
click to vote
COLT
2004
Springer
16 years 3 days ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...