2031 search results - page 268 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
DAGSTUHL
2007
13 years 9 months ago
2007
The ways in which an agent’s actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of ...
WSCG
2004
13 years 9 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...
LATIN
2010
Springer
13 years 6 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...
STOC
2009
ACM
14 years 8 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...