1067 search results - page 115 / 214 » Probabilistic regular graphs |
108
click to vote
DM
2010
15 years 3 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
104
click to vote
JGAA
2007
15 years 3 months ago
2007
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
130
click to vote
PC
2010
15 years 1 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
121
click to vote
IMCSIT
2010
15 years 1 months ago
2010
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
157
click to vote
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
The most popular way to use probabilistic models in vision is first to extract some descriptors of small image patches or object parts using well-engineered features, and then to...