867 search results - page 76 / 174 » The Generalized Maximum Coverage Problem |
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
TC
2010
14 years 4 months ago
2010
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
SSPR
1998
Springer
15 years 2 months ago
1998
Springer
The Pseudo Fisher Linear Discriminant (PFLD) based on a pseudo-inverse technique shows a peaking behaviour of the generalization error for training sample sizes that are about the...
101
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
164
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...