1381 search results - page 18 / 277 » Fast Filtered Sampling |
111
click to vote
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
SMI
2006
IEEE
15 years 4 months ago
2006
IEEE
Particle systems, as originally proposed by Witkin and Heckbert [17], are a powerful way to sample implicit surfaces since they generate almost evenly distributed samples over the...
IJON
2007
14 years 10 months ago
2007
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...