By Topic

Dynamic Graphical Models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bilmes, J. ; An associate professor in the Department of Electrical Engineering at the University of Washington, Seattle, and is an adjunct professor in the Department of Computer Science and Engineering and the Department of Linguistics.

A graphical model consists of I a graph G = (V,E) and a V set of properties that determine a family of V probability distributions. There are many different types of graphs and properties, each determining a family. It is common to be able to develop algorithms that work for all members of the family by considering only a graph and its properties. Thus, solving difficult problems (such as deriving an approximation to an NP-complete optimization problem) might become worthwhile only because a solution can be applied many times for different problem instances.

Published in:

Signal Processing Magazine, IEEE  (Volume:27 ,  Issue: 6 )