Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

68

Voted

UAI
1996

favoriteEmaildiscussreport

126views Artificial Intelligence» more UAI 1996»

Computing upper and lower bounds on likelihoods in intractable networks

15 years 28 days ago

Computing upper and lower bounds on likelihoods in intractable networks

Download www.bitsavers.org

Tommi Jaakkola, Michael I. Jordan

Real-time Traffic

UAI 1996 | UAI 2008 |

claim paper

Related Content

» Sufficient Conditions for Intractability over BlackBox Groups Generic Lower Bounds for Gen...

» Lower and upper bounds for a twolevel hierarchical location problem in computer networks

» Bounded realtime dynamic programming RTDP with monotone upper bounds and performance guara...

» Inference in Multilayer Networks via Large Deviation Bounds

» Lower Upper Bound Estimation Method for Construction of Neural NetworkBased Prediction Int...

» Stochastic Bounds Applied to the End to End QoS in Communication Systems

» On Reversing Jensens Inequality

» Large Deviation Methods for Approximate Probabilistic Inference

» Bounds on the fading number of multipleinput singleoutput fading channels with memory

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1996
Where	UAI
Authors	Tommi Jaakkola, Michael I. Jordan

Comments (0)