3894 search results - page 102 / 779 » Approximation Algorithms for Biclustering Problems |
178
click to vote
CDC
2008
IEEE
16 years 25 days ago
2008
IEEE
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
174
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
214
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
153
click to vote
SIAMCO
2002
15 years 6 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
164
click to vote
IPL
2008
15 years 6 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...