779 search results - page 45 / 156 » Algorithms for the Sample Mean of Graphs |
136
click to vote
CSDA
2010
15 years 4 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
138
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
135
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
161
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...