3894 search results - page 121 / 779 » Approximation Algorithms for Biclustering Problems |
176
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
154
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
135
click to vote
EVOW
1999
Springer
15 years 10 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
179
click to vote
PKDD
2009
Springer
16 years 28 days ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
213
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...