193 search results - page 14 / 39 » Members of Random Closed Sets |
122
click to vote
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
85
Voted
ICPR
2004
IEEE
16 years 24 days ago
2004
IEEE
This paper introduces a new stochastic surface model for deformable 3D surfaces and demonstrates its utility for the purpose of 3D sculpting. This is the problem of simple-touse a...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
140
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...