787 search results - page 30 / 158 » Polynomial Constants are Decidable |
ECCC
2006
13 years 8 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
ICIP
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we propose a novel technique to represent and recover optical flow through free form deformations. Such a technique is based on representing the motion field usin...
MFCS
2001
Springer
14 years 13 days ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
CPC
2006
13 years 8 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...