4378 search results - page 188 / 876 » On the Complexity of Ordered Colourings |
148
click to vote
ISSAC
2007
Springer
16 years 21 days ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
172
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
232
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
167
click to vote
MASCOTS
2007
15 years 8 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
173
click to vote
RIAO
2000
15 years 8 months ago
2000
We present a framework to analyze color documents of complex layout. In addition, no assumption is made on the layout. Our framework combines in a content-driven bottom-up approac...