520 search results - page 104 / 104 » On the discovery of process models from their instances |
103
Voted
IWRIDL
2006
ACM
15 years 5 months ago
2006
ACM
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
110
click to vote
LLL
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
CONCUR
1992
Springer
15 years 3 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
DNA
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
DAGSTUHL
2007
15 years 1 months ago
2007
The process of match formation in matching markets can be divided into three parts: information sharing, investments in information acquisition, and the formation of matches based...