Sciweavers

4378 search results - page 10 / 876
» On the Complexity of Ordered Colourings
Sort
View
EVOW
2004
Springer
14 years 1 months ago
Binary Merge Model Representation of the Graph Colouring Problem
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
István Juhos, Attila Tóth, Jano I. v...
ACSC
2010
IEEE
13 years 2 months ago
Measuring visual consistency in 3d rendering systems
One of the major challenges facing a present day game development company is the removal of bugs from such complex virtual environments. This work presents an approach for measuri...
Alfredo Nantes, Ross Brown, Frédéric...
EVOW
2006
Springer
13 years 11 months ago
Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
István Juhos, Jano I. van Hemert
ICVS
2009
Springer
14 years 2 months ago
Real-Time Traversable Surface Detection by Colour Space Fusion and Temporal Analysis
Abstract. We present a real-time approach for traversable surface detection using a low-cost monocular camera mounted on an autonomous vehicle. The proposed methodology extracts co...
Ioannis Katramados, Steve Crumpler, Toby P. Brecko...
CAIP
2003
Springer
166views Image Analysis» more  CAIP 2003»
14 years 25 days ago
Unsupervised Segmentation Incorporating Colour, Texture, and Motion
Abstract. In this paper we integrate colour, texture, and motion into a segmentation process. The segmentation consists of two steps, which both combine the given information: a pr...
Thomas Brox, Mikaël Rousson, Rachid Deriche, ...