1404 search results - page 105 / 281 » Optimization problems in multiple-interval graphs |
124
click to vote
AGTIVE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
134
click to vote
ICPP
1999
IEEE
15 years 7 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
110
click to vote
EMNLP
2006
15 years 4 months ago
2006
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
122
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
110
click to vote
AAAI
2008
15 years 5 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...