1092 search results - page 53 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
146
Voted
IS
2010
15 years 4 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
154
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
175
click to vote
TCS
2010
15 years 4 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
161
click to vote
ICCV
2007
IEEE
16 years 3 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
138
click to vote
CSR
2008
Springer
15 years 7 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...