Buscar
Mostrando ítems 1-10 de 111
Finding four independent trees
(Siam PublicationsPhiladelphiaEUA, 2006)
Random perturbations of stochastic processes with unbounded variable length memory
(UNIV WASHINGTON, DEPT MATHEMATICS, 2008)
We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. ...
CHAIN DECOMPOSITIONS OF 4-CONNECTED GRAPHS
(Siam PublicationsPhiladelphiaEUA, 2005)
The Polya Tree Sampler: Toward Efficient and Automatic Independent Metropolis-Hastings Proposals
(AMER STATISTICAL ASSOC, 2011)
We present a simple, efficient, and computationally cheap sampling method for exploring an unnormalized multivariate density on R-d, such as a posterior density, called the Polya tree sampler. The algorithm constructs an ...
SPECTRUM OF STOCHASTIC ADDING MACHINES AND FIBERED JULIA SETS
(World Scientific Publ Co Pte Ltd, 2013-09-01)
Consider the basic algorithm to perform the transformation n bar right arrow n + 1 changing digits of the d-adic expansion of n one by one. We obtain a family of Markov chains on the non-negative integers through successive ...
A non-iterative sampling Bayesian method for linear mixed models with normal independent distributions
(Taylor & Francis LtdAbingdonInglaterra, 2012)
Context tree selection: A unifying view
(ELSEVIER SCIENCE BV, 2011)
Context tree models have been introduced by Rissanen in [25] as a parsimonious generalization of Markov models. Since then, they have been widely used in applied probability and statistics. The present paper investigates ...
Use of genetic algorithms and solvation potential to study peptides structure
(Elsevier B.V., 2008-02-01)
In this work, genetic algorithms concepts along with a rotamer library for proteins side chains and implicit solvation potential are used to optimize the tertiary structure of peptides. We starting from the known PDB ...
Use of genetic algorithms and solvation potential to study peptides structure
(Elsevier B.V., 2008-02-01)
In this work, genetic algorithms concepts along with a rotamer library for proteins side chains and implicit solvation potential are used to optimize the tertiary structure of peptides. We starting from the known PDB ...