44 search results - page 6 / 9 » (p, 1)-Total labelling of graphs |
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
136
click to vote
WG
2010
Springer
14 years 7 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
EJC
2006
14 years 9 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...