499 search results - page 7 / 100 » A Dynamic-Programming Based ASP-Solver |
NAACL
2010
13 years 5 months ago
2010
This paper describes an efficient sampler for synchronous grammar induction under a nonparametric Bayesian prior. Inspired by ideas from slice sampling, our sampler is able to dra...
JMLR
2012
11 years 10 months ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
EOR
2006
13 years 7 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...