1258 search results - page 41 / 252 » Architecture-driven Problem Decomposition |
TALG
2010
13 years 7 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
ECRTS
2009
IEEE
13 years 7 months ago
2009
IEEE
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
CCCG
2003
13 years 10 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
ICIP
2004
IEEE
14 years 11 months ago
2004
IEEE
The decomposition of an image into its primitive components, such as cartoon plus texture, is a fundamental problem in image processing. In [11, 16], the authors proposed a techni...
ISDA
2006
IEEE
14 years 3 months ago
2006
IEEE
The use of monolithic neural networks (such as a multilayer perceptron) has some drawbacks: e.g. slow learning, weight coupling, the black box effect. These can be alleviated by t...