3020 search results - page 209 / 604 » Optimal partition trees |
175
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
153
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
177
click to vote
CHARME
2001
Springer
15 years 10 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
169
click to vote
CSREAESA
2006
15 years 8 months ago
2006
Transport triggered architecture (TTA) has been shown to provide an efficient way to design application specific instruction set processors. However, the interconnection network of...
173
Voted
AUTOMATICA
2008
15 years 6 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...