836 search results - page 137 / 168 » Orthogonal Colorings of Graphs |
164
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
264
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
172
click to vote
SIROCCO
2007
15 years 7 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
160
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
182
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...