Sciweavers

783 search results - page 140 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 16 days ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 10 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 9 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
SIGGRAPH
1993
ACM
14 years 21 days ago
Combining hierarchical radiosity and discontinuity meshing
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
Dani Lischinski, Filippo Tampieri, Donald P. Green...