4378 search results - page 154 / 876 » On the Complexity of Ordered Colourings |
126
click to vote
JGO
2008
15 years 6 months ago
2008
Abstract In order to study the uniformly translating solution of some non-linear evolution equations such as the complex Ginzburg
143
click to vote
ORDER
2010
15 years 4 months ago
2010
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...
197
click to vote
PAMI
2010
15 years 4 months ago
2010
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
265
click to vote
PAMI
2012
13 years 9 months ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
162
click to vote
CP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...