1984 search results - page 11 / 397 » The colourful feasibility problem |
TCS
2010
13 years 4 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
HVEI
2009
13 years 7 months ago
2009
The classical approach to converting colour to greyscale is to code the luminance signal as a grey value image. However, the problem with this approach is that the detail at equil...
COMBINATORICS
2002
13 years 9 months ago
2002
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
ECCV
2000
Springer
14 years 11 months ago
2000
Springer
Abstract. In his paper we introduce two improvements to the threedimensional gamut mapping approach to computational colour constancy. This approach consist of two separate parts. ...
COR
2010
13 years 10 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...