1984 search results - page 6 / 397 » The colourful feasibility problem |
PRL
2007
13 years 9 months ago
2007
This paper addresses the problem of compensating for lateral chromatic aberration in digital images through colour plane realignment. Two main contributions are made: the derivati...
BIRTHDAY
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
EVOW
2004
Springer
14 years 3 months ago
2004
Springer
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...
CSCW
2008
ACM
13 years 11 months ago
2008
ACM
COMBINATORICS
2006
13 years 10 months ago
2006
We present both probabilistic and constructive lower bounds on the maximum size of a set of points S Rd such that every angle determined by three points in S is acute, considerin...