4894 search results - page 605 / 979 » The Guarding Problem - Complexity and Approximation |
145
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
115
click to vote
FS
2006
15 years 4 months ago
2006
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
164
click to vote
JAIR
2006
15 years 4 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
137
Voted
CVGIP
2007
15 years 4 months ago
2007
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
126
click to vote
JMIV
2006
15 years 4 months ago
2006
Abstract - Certain structure detection problems can be solved by sampling a parameter space for the different structures at a finite number of points and checking each point to see...