7015 search results - page 179 / 1403 » Approximation algorithms for co-clustering |
106
click to vote
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
144
click to vote
TSMC
2010
14 years 10 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
104
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
135
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
134
click to vote
STACS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...