7015 search results - page 15 / 1403 » Approximation algorithms for co-clustering |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X â IR on a topological space X, its level set fâ1 (a) changes continuously as the real value a changes. Consequently, the connected components...
DAC
2011
ACM
12 years 7 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
SIAMCO
2002
13 years 7 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (â + 1)2 synchronous communication rounds,...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...