Sciweavers

4 search results - page 1 / 1
» The m-Colored Composition Poset
Sort
View
COMBINATORICS
2007
81views more  COMBINATORICS 2007»
13 years 4 months ago
The m-Colored Composition Poset
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
Brian Drake, T. Kyle Petersen
FUIN
2007
122views more  FUIN 2007»
13 years 4 months ago
Behaviour Algebras
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...
Józef Winkowski
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 4 months ago
On the logical definability of certain graph and poset languages
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...
Pascal Weil
ER
2011
Springer
265views Database» more  ER 2011»
12 years 4 months ago
Modeling the Propagation of User Preferences
Abstract. User preferences are a fundamental ingredient of personalized database applications, in particular those in which the user context plays a key role. Given a set of prefer...
Paolo Ciaccia, Riccardo Torlone