Sciweavers

306 search results - page 37 / 62
» Parallel approximation algorithms for facility-location prob...
Sort
View
ICDCS
2006
IEEE
15 years 9 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
134
Voted
DKE
2006
125views more  DKE 2006»
15 years 3 months ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier
EGH
2009
Springer
15 years 1 months ago
Parallel view-dependent tessellation of Catmull-Clark subdivision surfaces
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
Anjul Patney, Mohamed S. Ebeida, John D. Owens
EUROPAR
2007
Springer
15 years 10 months ago
Cooperation in Multi-organization Scheduling
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
Fanny Pascual, Krzysztof Rzadca, Denis Trystram
117
Voted
DCOSS
2009
Springer
15 years 10 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...