4378 search results - page 61 / 876 » On the Complexity of Ordered Colourings |
166
click to vote
AP2PC
2003
Springer
16 years 1 days ago
2003
Springer
Open trading environments involve a type of peer-to-peer computing characterised by well-defined interaction protocols that are used by the traders and sometimes updated dynamicall...
197
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
198
click to vote
IDEAL
2004
Springer
16 years 5 days ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
173
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
197
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents an algorithm capable of real-time separation of foreground from background in monocular video sequences. Automatic segmentation of layers from colour/contrast ...