2310 search results - page 184 / 462 » Coloring Random Graphs |
132
click to vote
ICIP
2009
IEEE
15 years 3 days ago
2009
IEEE
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
119
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
122
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
130
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
102
click to vote
STOC
1990
ACM
15 years 6 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...