1984 search results - page 13 / 397 » The colourful feasibility problem |
CSR
2008
Springer
13 years 10 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
CRYPTO
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
ERCIMDL
2000
Springer
14 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
CONSTRAINTS
2007
13 years 9 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...