1125 search results - page 43 / 225 » On the job rotation problem |
ALGORITHMICA
2011
13 years 5 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
NIPS
1990
13 years 11 months ago
1990
Previous work (M.I. Sereno, 1989; cf. M.E. Sereno, 1987) showed that a feedforward network with area V1-like input-layer units and a Hebb rule can develop area MT-like second laye...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
EUROPAR
2010
Springer
13 years 10 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...