1389 search results - page 100 / 278 » Improved Approximation Algorithms for Label Cover Problems |
126
click to vote
PKDD
2009
Springer
15 years 9 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
135
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
136
Voted
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
137
Voted
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
EOR
2006
15 years 3 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...