661 search results - page 123 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
194
Voted
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
136
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
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 ...
143
Voted
SENSYS
2003
ACM
15 years 7 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
132
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
116
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...