1404 search results - page 138 / 281 » Optimization problems in multiple-interval graphs |
115
click to vote
EUROPAR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
101
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
109
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
113
click to vote
ICFP
2003
ACM
16 years 2 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
141
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...