72 search results - page 6 / 15 » On the Complements of Partial k-Trees |
CLADE
2004
IEEE
14 years 2 months ago
2004
IEEE
A key challenge faced by large-scale, distributed applications in Grid environments is efficient, seamless data management. In particular, for applications that can benefit from a...
CIAC
2006
Springer
14 years 2 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
FSTTCS
2008
Springer
13 years 12 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
TEC
2010
13 years 5 months ago
2010
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
ICIP
2002
IEEE
15 years 13 days ago
2002
IEEE
Automatic reconstruction of a complete 3D model of a complex object is presented. The complete 3D model is reconstructed by integrating two 3D models which are reconstructed from ...