4843 search results - page 594 / 969 » The Shortcut Problem - Complexity and Approximation |
129
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, both non-mixing and mixing local minima of the entropy are analyzed from the viewpoint of blind source separation (BSS); they correspond respectively to acceptable a...
150
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...
119
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...
166
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...
139
click to vote
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...