1067 search results - page 57 / 214 » Probabilistic regular graphs |
175
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
108
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
JCT
2007
15 years 13 days ago
2007
Every finite, self-dual, regular (or chiral) 4-polytope of type {3, q, 3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we ob...
110
Voted
IBPRIA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
111
click to vote
SIROCCO
1997
15 years 1 months ago
1997
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual “probabilistic construction”. Also, the best k...