260 search results - page 23 / 52 » Hardness of Parameterized Resolution |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a temporal super resolution approach for quasi-periodic image sequence such as human gait. The proposed method effectively combines examplebased and reco...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
ESTIMEDIA
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for fine grain QoS control of multimedia applications. This method takes as input an application software composed of actions parameterized by quality levels. ...