7015 search results - page 48 / 1403 » Approximation algorithms for co-clustering |
OL
2010
13 years 3 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
WSC
2004
13 years 10 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
SIROCCO
2008
13 years 10 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...