16404 search results - page 215 / 3281 » A set coverage problem |
122
Voted
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
134
Voted
AIPS
2008
15 years 6 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...
138
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
136
Voted
PAMI
2002
15 years 3 months ago
2002
Tracking regions in an image sequence is a challenging and di cult problem in image processing and computer vision, and at the same time, one that has many important applications:...
141
Voted
SIAMJO
2008
15 years 3 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...