187 search results - page 17 / 38 » Coloring linear orders with Rado's partial order |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose an algorithm that simultaneously extracts
disparities and alpha matting information given a stereo
image pair. Our method divides the reference image into
a set of ov...
ISCI
2010
2010
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
13 years 7 months ago
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
CONCUR
1992
Springer
14 years 17 days ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...