112 search results - page 12 / 23 » Distributed anonymous discrete function computation |
PODC
2010
ACM
13 years 10 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
CVPR
2003
IEEE
14 years 8 months ago
2003
IEEE
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
CLUSTER
2004
IEEE
13 years 10 months ago
2004
IEEE
Modern computational science applications are becoming increasingly multi-disciplinaty involving widely distributed research teams and their underlying computational platforms. A ...