271 search results - page 10 / 55 » The lattice of embedded subsets |
155
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
183
click to vote
DAM
2011
15 years 24 days ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
151
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
149
click to vote
ISMM
2009
Springer
16 years 12 days ago
2009
Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
160
click to vote
TIT
1998
15 years 5 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...