S. M. Aji and R. J. McEliece. The generalized distributive law. Technical Report, Department of Electrical Engineering, California Institute of Technology, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Software Foundation Libraries for Intelligent Systems - Baldi, Chauvin, Van.. (Correct)
....variables. Evidence propagation is NP complete in the general case [13] But for singly connected graphs (no more than one path between any two nodes in the underlying undirected graph) propagation can be executed in time linear with n, the number of nodes, using a simple message passing approach [34, 2]. In the general case, all known exact algorithms for multiply connected network rely on the construction of an equivalent singly connected networks, the junction tree, by clustering the original variables, according to the cliques of the corresponding triangulated moral graph [34, 29, 37] with ....
....to be special cases of belief propagation and typically of Pearl s algorithm. Such reductions usually have simplified and illuminated the original derivation. Examples of this phenomena include Fourier and Hadamard transforms, a number of decoding algorithms (Gallager Tanner Wiberg, Turbo, etc. [2, 30, 18], Kalman filters (the RauchTung Streibel smoother) the EM algorithm for hiddden Markov models [39] and the inside outside algorithm for stochastic context free grammars [7] Both emprirical and theoretical evidence suggest that at least in some situations the simple message passing algorithm ....
S. M. Aji and R. J. McEliece. The generalized distributive law. Technical Report, Department of Electrical Engineering, California Institute of Technology, 1997.
A New Algorithm for Computing Shortest Paths in Weighted.. - Mata, Mitchell (1997) (17 citations) (Correct)
....weight function F , there is an inherent error in distance estimate, since we measure grid distance instead of Euclidean distance. For 4 connectivity this digitization bias (aliasing) results in an error factor of p 2; for 8 connectivity, it results in a factor of ( p 2 1) p 5 = 1:08. See [18, 20] for discussions on the digitization bias problem, and on different distance transforms that can be used to address it. One approach to reducing grid bias is to increase the connectivity of the grid. Thus, the grid based algorithm that we implemented includes an enhancement to the usual methods, ....
I. Ragnemalm. The Euclidean distance transform. Linkoping Studies in Science and Technology, Ph.D. Dissertation 304, Department of Electrical Engineering, Linkoping University, Sweden, 1993.
Voronoi Tessellation of Points with Integer Coordinates.. - Ogniewicz, Kübler (1993) (Correct)
No context found.
I. Ragnemalm, The Euclidean Distance Transform, PhD thesis, Department of Electrical Engineering, Linkoping University, Linkoping, Sweden, (1993), Diss. No. 304. 6
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC