1153 search results - page 107 / 231 » Reversing graph transformations |
118
click to vote
AGTIVE
2007
Springer
15 years 7 months ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
110
click to vote
CVPR
2007
IEEE
16 years 2 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...
122
click to vote
CASES
2010
ACM
14 years 9 months 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...
67
Voted
BIRTHDAY
2009
Springer
15 years 7 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...
DAM
2007
15 years 21 days ago
2007
This work describes a study on the generation of bicliques of a graph. We show that it is NP-complete to test whether a subset of the vertices of a graph is part of a biclique. We ...