271 search results - page 10 / 55 » The lattice of embedded subsets |
105
Voted
CORR
2008
Springer
15 years 16 days 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 ...
129
click to vote
DAM
2011
14 years 7 months 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...
106
click to vote
LFCS
1992
Springer
15 years 4 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 ...
91
Voted
ISMM
2009
Springer
15 years 7 months 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...
102
Voted
TIT
1998
15 years 2 days 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...