3894 search results - page 336 / 779 » Approximation Algorithms for Biclustering Problems |
183
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
185
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
127
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
170
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
158
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...