2004 search results - page 45 / 401 » Sampling from large graphs |
113
click to vote
OSDI
2008
ACM
16 years 2 days ago
2008
ACM
Previous work showed that statistical analysis techniques could successfully be used to construct compact signatures of distinct operational problems in Internet server systems. B...
APVIS
2008
15 years 1 months ago
2008
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
170
click to vote
UAI
2008
15 years 1 months ago
2008
Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvant...
BIOCOMP
2007
15 years 1 months ago
2007
— This paper describes graph-based relational, unsupervised learning algorithm to infer node replacement graph grammar and its application to metabolic pathways. We search for fr...
ICCV
1999
IEEE
15 years 4 months ago
1999
IEEE
:We formulate structure from motion as a Bayesian inference problem, and use a Markov chain Monte Carlo sampler to sample the posterior on this problem. This results in a method th...