4378 search results - page 2 / 876 » On the Complexity of Ordered Colourings |
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
The problem of colour image segmentation is investigated in the context of mathematical morphology. Morphological operators are extended to colour images by means of a lexicographi...
IPL
2008
13 years 4 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
APN
1992
Springer
13 years 9 months ago
1992
Springer
The use of different High-level Petri net formalisms has made it possible to create Petri net models of large systems. Even though the use of such models allows the modeller to cr...
MLQ
2010
13 years 3 months ago
2010
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We define a new reduced model to represent coloured images. We propose to use two components for a full definition of a colour instead of three. To that end we take advantage of...