Browsing by Author "Le, T."
Now showing items 1-9 of 9
-
Conference Object
Bounds on max-product algorithms for multiple fault diagnosis in graphs with loops
Le, T.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2007)In this paper, we analyze the performance of algorithms that use belief propagation max-product iterations to solve the generalized multiple fault diagnosis (GMFD) problem. The GMFD problem is described by a bipartite ...
-
Conference Object
Convergence of belief propagation algorithms on binary pairwise Gibbs random fields
Le, T.; Hadjicostis, Christoforos N. (2011)In this paper, we study the convergence of belief propagation algorithms (BPAs) on binary pairwise Gibbs random fields (BP-GRFs). Exploiting the equivalence of BPA on the graph associated with BP-GRF and the corresponding ...
-
Article
Graphical inference for multiple intrusion detection
Le, T.; Hadjicostis, Christoforos N. (2008)In this paper, we consider vulnerabilities of networked systems and develop a multiple intrusion detection system (MIDS) which operates by running belief propagation on an appropriately constructed weighted bipartite graph. ...
-
Conference Object
Graphical inference methods for fault diagnosis based on information from unreliable sensors
Le, T.; Hadjicostis, Christoforos N. (2006)In this paper, we study the application of decoding algorithms to the multiple fault diagnosis (MFD) problem. Prompted by the resemblance between graphical representations for MFD problems and parity check codes, we develop ...
-
Conference Object
Improved performance bounds on max-product algorithms for multiple fault diagnosis in graphs with loops
Le, T.; Hadjicostis, Christoforos N. (2008)In this paper, we analyze the performance of belief propagation max-product algorithms when used to solve the multiple fault diagnosis (MFD) problem. The MFD problem is described by a bipartite diagnosis graph (BDG) which ...
-
Conference Object
Low-complexity max-product algorithms for problems of multiple fault diagnosis
Le, T.; Hadjicostis, Christoforos N. (2008)In this paper, we propose low-complexity max-product algorithms for the problem of multiple fault diagnosis (MFD). The MFD problem is described by a bipartite diagnosis graph (BDG) which consists of a set of components, a ...
-
Conference Object
Marginal analysis on binary pairwise Gibbs random fields
Le, T.; Hadjicostis, Christoforos N. (2011)In this paper, we study marginal problems for a class of binary pairwise Gibbs random fields (BPW-GRFs). Given a BPW-GRF associated with a family of binary positive pairwise potentials, finding the exact marginal for each ...
-
Article
Max-product algorithms for the generalized multiple-fault diagnosis problem
Le, T.; Hadjicostis, Christoforos N. (2007)In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...
-
Conference Object
Performance analysis of sum-product algorithms for multiple fault diagnosis applications
Le, T.; Tatikonda, S.; Hadjicostis, Christoforos N. (2010)In this paper, we study the application of sum-product algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic ...