347 search results - page 25 / 70 » The Berlekamp-Massey Algorithm revisited |
90
Voted
RSFDGRC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of [11], as well as new pro...
79
Voted
CVPR
2008
IEEE
16 years 28 days ago
2008
IEEE
Computational color constancy is the task of estimating the true reflectances of visible surfaces in an image. In this paper we follow a line of research that assumes uniform illu...
ECCV
2000
Springer
16 years 23 days ago
2000
Springer
In this paper, we study general questions about the solvability of the Kruppa equations and show that, in several special cases, the Kruppa equations can be renormalized and becom...
92
Voted
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...