212 search results - page 16 / 43 » Complexity Parameters for First-Order Classes |
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
ALT
2006
Springer
14 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
ASC
2008
13 years 6 months ago
2008
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
AAAI
1994
13 years 8 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
BMCBI
2008
13 years 6 months ago
2008
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...