9842 search results - page 244 / 1969 » The Complexity of the Matching-Cut Problem |
85
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
TAMC
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
119
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
110
Voted
MOBIHOC
2008
ACM
16 years 4 days ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
104
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...