3894 search results - page 301 / 779 » Approximation Algorithms for Biclustering Problems |
202
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
175
click to vote
ALDT
2009
Springer
16 years 1 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
177
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
213
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
166
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...