3894 search results - page 149 / 779 » Approximation Algorithms for Biclustering Problems |
184
click to vote
AGI
2008
15 years 8 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
134
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
179
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
190
click to vote
CCE
2005
15 years 6 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...