3604 search results - page 298 / 721 » Relation rule mining |
154
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the de...
135
click to vote
BIRTHDAY
2000
Springer
15 years 10 months ago
2000
Springer
Various forms of assumption/commitment specifications have been used to specify and reason about the interference that comes from concurrent execution; in particular, consistent a...
174
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
197
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The goal of most microarray studies is either the identification of genes that are most differentially expressed or the creation of a good classification rule. The dis...
157
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
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 ...