1952 search results - page 363 / 391 » Complete partitions of graphs |
152
click to vote
STTT
2010
15 years 2 months ago
2010
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
152
click to vote
CISC
2009
Springer
15 years 2 months ago
2009
Springer
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
164
click to vote
CPC
2010
15 years 1 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
164
click to vote
CVPR
2011
IEEE
15 years 19 days ago
2011
IEEE
In this paper, we propose a novel framework for contour based object detection. Compared to previous work, our contribution is three-fold. 1) A novel shape matching scheme suitabl...
154
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...