7015 search results - page 176 / 1403 » Approximation algorithms for co-clustering |
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
APPROX
1998
Springer
14 years 1 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...