3894 search results - page 152 / 779 » Approximation Algorithms for Biclustering Problems |
224
click to vote
STACS
2005
Springer
16 years 9 days ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
270
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
142
click to vote
ARITH
2007
IEEE
16 years 1 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
166
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
169
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...