402 search results - page 71 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
AAAI
2008
13 years 9 months ago
2008
Multiple instance learning (MIL) is a branch of machine learning that attempts to learn information from bags of instances. Many real-world applications such as localized content-...
FSTTCS
2008
Springer
13 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
EMMCVPR
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
CVPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...