30 search results - page 4 / 6 » Bounded Nondeterminism and Alternation in Parameterized Comp... |
113
click to vote
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
CPM
1999
Springer
15 years 1 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
IFIP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...