220 search results - page 26 / 44 » Primal-Dual Algorithms for Connected Facility Location Probl... |
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
101
click to vote
CEC
2009
IEEE
15 years 3 months ago
2009
IEEE
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
DCOSS
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...