7015 search results - page 1228 / 1403 » Approximation algorithms for co-clustering |
SSD
2005
Springer
14 years 3 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
ACMMSP
2004
ACM
14 years 3 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
ARCS
2004
Springer
14 years 3 months ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
ATAL
2004
Springer
14 years 3 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
CAAN
2004
Springer
14 years 3 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...