925 search results - page 17 / 185 » Connectivity on Complete Lattices |
108
click to vote
DAM
2010
14 years 12 months ago
2010
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
197
click to vote
POPL
2007
ACM
16 years 2 days ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For m...
ACS
2004
14 years 11 months ago
2004
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
119
click to vote
CPC
2010
14 years 9 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...