664 search results - page 68 / 133 » An objective way to evaluate and compare binarization algori... |
CLUSTER
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this article we tackle the problem of scheduling a dynamically generated DAG of multi-processor tasks (M-tasks). At first, we outline the need of such a scheduling approach...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper shows that the performance of a binary classifier can be significantly improved by the processing of structured unlabeled data, i.e. data are structured if knowing the ...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
ASC
2008
13 years 8 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...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...