Metropolis

Known as: Metropolis (anime), Metoroporisu, Metropolis (2001 movie) 
Metropolis (メトロポリス Metoroporisu) is a 2001 Japanese animated science fiction action film loosely based on the 1949 Metropolis manga created by Osamu… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
  • Georg Simmel
  • 2008
The deepest problems of modern life derive from the claim of the individual to preserve the autonomy and individuality of his… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
MOTIVATION Bayesian estimation of phylogeny is based on the posterior probability distribution of trees. Currently, the only… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A solid design flow must capture designs at well-defined levels of abstraction and proceed toward an efficient implementation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This article provides a framework for estimating the marginal likelihood for the purpose of Bayesian model comparisons . The… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A proper choice of a proposal distribution for Markov chain Monte Carlo methods, for example for the Metropolis±Hastings… (More)
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper we derive conditions for geometric ergodicity of the random walk-based Metropolis algorithm on R k. We show that at… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm in… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The Metropolis-Hastings algorithm is a method of constructing a reversible Markov transition kernel with a speci ed invariant… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In a random graph on n vertices, the maximum clique is likely to be of size very close t o 2 lg n. However, the clique produced… (More)
Is this relevant?