29908 search results - page 307 / 5982 » On the Complexity of |
206
click to vote
AAAI
2012
13 years 9 months ago
2012
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
169
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper proposes a new method for binarization of digital documents. The proposed approach performs binarization by using a heuristic algorithm with two different thresholds an...
146
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper presents a new technique based on anisotropic diffusion for segmenting color images. This operation is accomplished through two independent anisotropic diffusion proces...
160
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
159
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...