Back to Results
First PageMeta Content
Statistical models / Graphical models / Computational statistics / Monte Carlo methods / Markov chain / Bayesian network / Probabilistic logic / Gibbs sampling / Bayesian inference in phylogeny / Statistics / Probability and statistics / Markov models


Approximate inference for first-order probabilistic languages Hanna Pasula and Stuart Russell Computer Science Division, University of California 387 Soda Hall, Berkeley, CA[removed]fpasula,[removed]
Add to Reading List

Document Date: 2008-01-03 13:57:07


Open Document

File Size: 135,76 KB

Share Result on Facebook

City

Tokyo / Madison / San Mateo / Cambridge / London / Nagoya / Austin / Boston / Stockholm / /

Company

Wellman / M-H / qU / MIT Press / PWS Publishing / Monte Carlo / AAAI Press / /

Country

Japan / Sweden / /

Currency

pence / /

/

Facility

Stanford University / University of California / Soda Hall / /

IndustryTerm

variable elimination algorithm / inference algorithm / simpler network / semantic networks / logical systems / identity uncertainty algorithm / /

Movie

At first sight / /

Organization

Stuart Russell Computer Science Division / University of California / MIT / Stanford University / /

Person

Pi / Michael Ostland / Stuart J. Russell / Andrew Gelman / Stuart Russell / Hanna Pasula / Eric H. Wefald / Morgan Kaufmann / /

Position

editor / advisor / Professor / advisors / /

ProgrammingLanguage

Prolog / /

ProvinceOrState

Texas / Wisconsin / California / Massachusetts / /

PublishedMedium

Complex Systems / Journal of Artificial Intelligence Research / /

SportsLeague

Stanford University / /

Technology

variable elimination algorithm / artificial intelligence / slow algorithm / inference algorithm / Hastings algorithm / Dom / identity uncertainty algorithm / Gibbs sampling algorithm / /

SocialTag