4099 search results - page 292 / 820 » First Class Patterns |
172
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
165
click to vote
JAIR
2008
15 years 6 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
185
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
154
click to vote
JSYML
2002
15 years 6 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
130
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...