Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Introducing process-aware information systems (PAIS) in enterprises is usually associated with high costs. It is therefore crucial to understand those factors that determine these ...
Bela Mutschler, Manfred Reichert, Stefanie Rinderl...