7015 search results - page 62 / 1403 » Approximation algorithms for co-clustering |
LATIN
2000
Springer
14 years 20 days ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
ORL
2007
13 years 8 months ago
2007
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. ...
DAC
1999
ACM
14 years 10 months ago
1999
ACM
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...