2310 search results - page 296 / 462 » Coloring Random Graphs |
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
NIPS
2003
13 years 9 months ago
2003
In this paper we present Discriminative Random Fields (DRF), a discriminative framework for the classification of natural image regions by incorporating neighborhood spatial depe...
CONNECTION
2006
13 years 8 months ago
2006
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
IJAHUC
2008
13 years 8 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...