7015 search results - page 29 / 1403 » Approximation algorithms for co-clustering |
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
ORL
1998
13 years 7 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
ORL
2008
13 years 7 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.