2254 search results - page 139 / 451 » Computing the minimal covering set |
104
click to vote
PPOPP
2006
ACM
15 years 6 months ago
2006
ACM
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. In many cases, users wishi...
100
Voted
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Although steady progress has been made in recent stereo algorithms, producing accurate results in the neighborhood of depth discontinuities remains a challenge. Moreover, among th...
97
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
93
Voted
EURODAC
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper presents a novel approach to scheduling of hardware supported synchronization operations. The optimization goal is to minimize the interation time of processes and thus...
CCCG
2006
15 years 2 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...