40 search results - page 3 / 8 » The Pair Completion algorithm for the Homogeneous Set Sandwi... |
ALENEX
2009
13 years 3 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
SCALESPACE
2001
Springer
13 years 10 months ago
2001
Springer
Bayesian statistical theory is a convenient way of taking a priori information into consideration when inference is made from images. In Bayesian image detection, the a priori dist...
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
SBACPAD
2005
IEEE
13 years 11 months ago
2005
IEEE
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...