2254 search results - page 92 / 451 » Computing the minimal covering set |
152
click to vote
RECOMB
2010
Springer
15 years 3 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
147
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We address the problem of having insufficient labels in an interactive image segmentation framework, for which most current methods would fail without further user inter...
152
Voted
ESCIENCE
2006
IEEE
15 years 8 months ago
2006
IEEE
Application execution time prediction is of key importance in making decisions about efficient usage of Grid resources. Grid services lack support of a generic application executi...
221
Voted
SCALESPACE
2007
Springer
15 years 10 months ago
2007
Springer
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piece...
160
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...