1986 search results - page 207 / 398 » Path Separability of Graphs |
138
click to vote
ACIVS
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
129
Voted
ICPP
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
138
Voted
ICPP
2002
IEEE
15 years 7 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
142
Voted
DILS
2006
Springer
15 years 6 months ago
2006
Springer
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
138
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...