598 search results - page 48 / 120 » Learning Generative Models with the Up-Propagation Algorithm |
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
117
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
109
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
74
Voted
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
120
click to vote
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...