Zoubin Ghahramani

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Iain Murray 0001

> Home > Persons > Zoubin Ghahramani

Publications

2012
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1207-4134
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1207-4134
Iain Murray, Zoubin Ghahramani:
Bayesian Learning in Undirected Graphical Models: Approximate MCMC algorithms. CoRR abs/1207.4134 (2012)
2006
[c47]
- view
  - electronic edition @ dslpitt.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/uai/MurrayGM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/MurrayGM06
Iain Murray, Zoubin Ghahramani, David J. C. MacKay:
MCMC for Doubly-intractable Distributions. UAI 2006
2005
[c37]
- view
- export record
  dblp key:
  - conf/nips/MurrayMGS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/MurrayMGS05
Iain Murray, David J. C. MacKay, Zoubin Ghahramani, John Skilling:
Nested sampling for Potts models. NIPS 2005: 947-954
2004
[c27]
- view
  - electronic edition @ dslpitt.org (archived)
  - no references & citations available
- export record
  dblp key:
  - conf/uai/MurrayG04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/MurrayG04
Iain Murray, Zoubin Ghahramani:
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms. UAI 2004: 392-399

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.