In this paper we present a folding algorithm to construct a process model from a specification given by a set of scenarios. Each scenario is formalized as a partially ordered set of activities of the process. As a process model we consider Event-driven Process Chains which are well established in the domain of business process modeling. Assuming that a specification describes valid behavior of ...

We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of the so-called runs conjecture (Kolpakov & Kucherov (FOCS ’99)), which states that the maximum number of runs ρ(n) in a string of length n is less than n. The proof is remarkably simple, considering the numerous endeavors to tackle this problem in the last 15...

This article analyzes the dynamic coordination problem among creditors of a firm with a time-varying fundamental and a staggered debt structure. In deciding whether to roll over his debt, each maturing creditor is concerned about the rollover decisions of other creditors whose debt matures during his next contract period. We derive a unique threshold equilibrium and characterize the roles of fu...

A run in a string is a nonextendable periodic substring in the string. Detecting all runs in a string is important and studied both from theoretical and practical points of view. In this paper, we consider the reverse problem of it. We reveal that the time complexity depends on the alphabet size k of the string to be output. We show that it is solvable in polynomial time for both binary alphabe...

Briefly, what approach or combination of approaches did you test in each of your submitted runs?  all runs: video decoding using ffmpeg library, sampling every 25th frame.  F_X_NO_TNO-SURFAC2_1: standard SURF keypoint detection, exhaustive search.  F_X_NO_TNO-BOWCOL_2: standard SURF keypoint detection, bag-of-words using 256 prototypes from queries, indexing and querying using Lemur.  F_X_N...