874 search results - page 69 / 175 » Graph Transformation in a Nutshell |
132
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
145
Voted
CASES
2010
ACM
15 years 10 days ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
82
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
141
Voted
IBIS
2006
15 years 3 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
116
Voted
JOT
2006
15 years 3 months ago
2006
Model transformation has become one of the most focused research field, motivated by for instance the OMG's Model-Driven Architecture (MDA). Metamodeling is a central techniq...