925 search results - page 8 / 185 » Connectivity on Complete Lattices |
ECAI
2004
Springer
15 years 2 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
60
Voted
EUSFLAT
2007
14 years 11 months ago
2007
Lattice-valued entropy functions defined by a lattice-valued possibilistic distribution π on a space Ω are defined as the expected value (in the sense of Sugeno integral) of ...
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
ICPR
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we investigate the possibilities offered by the extension of the connected component trees (cc-trees) to multivariate images. We propose a general framework for ima...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...