8699 search results - page 351 / 1740 » Elements of the Theory of Computation |
185
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
188
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
183
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Research in life sciences is benefiting from a large availability of formal description techniques and analysis methodologies. These allow both the phenomena investiga...
173
click to vote
TIT
2002
15 years 6 months ago
2002
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
191
click to vote
CCS
2007
ACM
16 years 1 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...