157 search results - page 19 / 32 » Frugal Colouring of Graphs |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
IJCV
2008
13 years 9 months ago
2008
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
AAMAS
2011
Springer
13 years 4 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
CPC
2006
13 years 9 months ago
2006
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky [Trans. Amer. Math. Soc. 334 (1992), 317-347] and Bollob
EMNLP
2010
13 years 7 months ago
2010
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...