144 search results - page 7 / 29 » Constraint Propagation in Graph Coloring |
3DIM
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—In this paper, we propose a novel propagationbased stereo matching algorithm. Starting from an initial disparity map, our algorithm selects highly reliable pixels and pr...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
WG
2001
Springer
13 years 12 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
EMNLP
2009
13 years 5 months ago
2009
We present a novel approach for multilingual document clustering using only comparable corpora to achieve cross-lingual semantic interoperability. The method models document colle...
SCAM
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...