356 search results - page 4 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
DAGSTUHL
2004
13 years 9 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
IPL
2002
13 years 7 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...