Sciweavers

458 search results - page 63 / 92
» exact 2009
Sort
View
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
IWCIA
2009
Springer
14 years 3 months ago
Sub-pixel Segmentation with the Image Foresting Transform
The Image Foresting Transform (IFT) is a framework for image partitioning, commonly used for interactive segmentation. Given an image where a subset of the image elements (seed-poi...
Filip Malmberg, Joakim Lindblad, Ingela Nyströ...
JSSPP
2009
Springer
14 years 3 months ago
Limits of Work-Stealing Scheduling
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...
Zeljko Vrba, Håvard Espeland, Pål Halv...
MFCS
2009
Springer
14 years 3 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
PROFES
2009
Springer
14 years 3 months ago
Integrating Value and Utility Concepts into a Value Decomposition Model for Value-Based Software Engineering
Value-based software engineering (VBSE) is an emerging stream of research that addresses the value considerations of software and extends the traditional scope of software engineer...
Mikko Rönkkö, Christian Frühwirth, ...