1225 search results - page 33 / 245 » The Instance Complexity Conjecture |
119
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
111
Voted
TAMC
2009
Springer
15 years 9 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...
125
Voted
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
In this paper, we investigate the detection of semantic
human actions in complex scenes. Unlike conventional
action recognition in well-controlled environments,
action detection...
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
164
Voted
DISOPT
2011
14 years 9 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...