2079 search results - page 72 / 416 » Universality of random graphs |
156
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
132
Voted
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
192
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
145
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
145
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...