Sciweavers

157 search results - page 29 / 32
» Frugal Colouring of Graphs
Sort
View
ANOR
2004
68views more  ANOR 2004»
13 years 5 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
HICSS
2009
IEEE
99views Biometrics» more  HICSS 2009»
14 years 25 days ago
Mycrocosm: Visual Microblogging
This paper introduces Mycrocosm, a microblogging site in which users communicate via statistical graphics, rather than the usual short text statements. Users of Mycrocosm can reco...
Yannick Assogba, Judith S. Donath
CSL
2009
Springer
14 years 18 days ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer
DM
1998
68views more  DM 1998»
13 years 5 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
CVPR
2006
IEEE
14 years 8 months ago
Bilayer Segmentation of Live Video
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 ...
Antonio Criminisi, Geoffrey Cross, Andrew Blake, V...