1812 search results - page 196 / 363 » Test Early, Test Often |
RTS
2011
14 years 5 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
JMLR
2012
13 years 18 days ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
84
Voted
CVPR
2007
IEEE
16 years 5 days ago
2007
IEEE
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...
CVPR
2008
IEEE
16 years 5 days ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of detecting anomalies in high arity categorical datasets. In most applications, anomalies are defined as data points that are 'abnormal'. Quite ...