Sciweavers

419 search results - page 54 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ML
2007
ACM
144views Machine Learning» more  ML 2007»
13 years 7 months ago
Invariant kernel functions for pattern analysis and machine learning
In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invarianc...
Bernard Haasdonk, Hans Burkhardt
ESWS
2007
Springer
14 years 1 months ago
Semantic EPC: Enhancing Process Modeling Using Ontology Languages
Abstract. In this article we describe a semantic extension of event-driven process chains, with which it is possible to specify the semantics of individual model elements as it is ...
Oliver Thomas, Michael Fellmann
DKE
2008
135views more  DKE 2008»
13 years 7 months ago
Analyzing interacting WS-BPEL processes using flexible model generation
We address the problem of analyzing the interaction between WS-BPEL processes. We present a technology chain that starts out with a WS-BPEL process and translates it into a Petri ...
Niels Lohmann, Peter Massuthe, Christian Stahl, Da...
CSFW
1998
IEEE
14 years 11 min ago
Honest Ideals on Strand Spaces
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
ENTCS
2006
168views more  ENTCS 2006»
13 years 7 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy