450 search results - page 7 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
112
click to vote
SPAA
2010
ACM
14 years 12 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
102
click to vote
JGAA
2006
14 years 11 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
111
click to vote
KDD
2007
ACM
16 years 6 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
101
click to vote
ETS
2009
IEEE
14 years 9 months ago
2009
IEEE
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...