1067 search results - page 12 / 214 » Probabilistic regular graphs |
PKDD
2009
Springer
14 years 4 months ago
2009
Springer
Probabilistic logics have attracted a great deal of attention during the past few years. While logical languages have taken a central position in research on knowledge representati...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
CPC
2007
13 years 9 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
COMBINATORICS
2007
13 years 9 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...