436 search results - page 58 / 88 » Recursion and Complexity |
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we consider the problem of object parsing,
namely detecting an object and its components by composing
them from image observations. Apart from object localization,
...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
ICFCA
2007
Springer
14 years 3 months ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...