296 search results - page 21 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
76
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
EMMCVPR
1999
Springer
15 years 1 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
IM
2007
14 years 9 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...