165 search results - page 9 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...
AIPS
2004
13 years 8 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
CJ
2010
13 years 7 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...