8 search results - page 2 / 2 » Graph Inference from a Walk for TRees of Bounded Degree 3 is... |
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...