925 search results - page 19 / 185 » Connectivity on Complete Lattices |
112
click to vote
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
TIT
1998
14 years 11 months ago
1998
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
105
click to vote
ORDER
2010
14 years 10 months ago
2010
We prove that every orthocomplete homogeneous effect algebra is sharply dominating. Let us denote the greatest sharp element below x by x↓. For every element x of an orthocomple...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
SIAMDM
2008
14 years 11 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...