Results 21 to 30 of about 717 (30)
Exact Enumeration and Sampling of Matrices with Specified Margins [PDF]
We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded.
Harrison, Matthew T., Miller, Jeffrey W.
core
Nonparametric Bayesian methods for one-dimensional diffusion models
In this paper we review recently developed methods for nonparametric Bayesian inference for one-dimensional diffusion models.
van Zanten, Harry
core +1 more source
We study the correlation of the occurrence of coronary heart disease (CHD) with the presence of the single-nucleotide polymorphism (SNP) at the -308 position of the tumor necrosis factor alpha (TNF-$\alpha$) gene.
Carvalho, C. Sofia +1 more
core +1 more source
A Multi-Scan Labeled Random Finite Set Model for Multi-object State Estimation
State space models in which the system state is a finite set--called the multi-object state--have generated considerable interest in recent years. Smoothing for state space models provides better estimation performance than filtering by using the full ...
Vo, Ba Ngu, Vo, Ba Tuong
core +1 more source
How to Integrate a Polynomial over a Simplex
This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and Straus.
Baldoni, Velleda +4 more
core +7 more sources
Practical bounds on the error of Bayesian posterior approximations: A nonasymptotic approach
Bayesian inference typically requires the computation of an approximation to the posterior distribution. An important requirement for an approximate Bayesian inference algorithm is to output high-accuracy posterior mean and uncertainty estimates ...
Broderick, Tamara +3 more
core
Predictive Entropy Search for Bayesian optimization with unknown constraints [PDF]
Unknown constraints arise in many types of expensive black-box optimization problems. Several methods have been proposed recently for performing Bayesian optimization with constraints, based on the expected improvement (EI) heuristic.
Adams, RP +4 more
core
ABC for Climate: Dealing with Expensive Simulators [PDF]
Edwards, Neil +3 more
core +1 more source
27th Annual Computational Neuroscience Meeting (CNS*2018): Part Two. [PDF]
europepmc +1 more source

