296 search results - page 24 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...
112
click to vote
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
103
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
71
Voted
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—This paper presents an approximate belief propagation algorithm that replaces outgoing messages from a node with the averaged outgoing message and propagates messages fr...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...