2254 search results - page 156 / 451 » Computing the minimal covering set |
178
click to vote
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract--Cloud computing, the new trend for service infrastructures requires user multi-tenancy as well as minimal capital expenditure. In a cloud that services large amounts of d...
148
click to vote
HPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizi...
204
click to vote
VLSM
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and...
147
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
189
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...