791 search results - page 86 / 159 » Approximating the Maximum Sharing Problem |
109
Voted
COCOA
2008
Springer
15 years 4 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...
140
Voted
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
160
Voted
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
106
Voted
ICIP
1997
IEEE
16 years 4 months ago
1997
IEEE
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
ACL
2008
15 years 4 months ago
2008
Researchers typically evaluate word prediction using keystroke savings, however, this measure is not straightforward. We present several complications in computing keystroke savin...