Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
We have acquired panelist data that provides hedonic (liking) ratings for a set of 40 flavors each composed of the same 7 ingredients at different concentration levels. Our goal...
Kalyan Veeramachaneni, Katya Vladislavleva, Matt B...
A fundamental problem of finding applications that are highly relevant to development tasks is the mismatch between the high-level intent reflected in the descriptions of these ...
Mark Grechanik, Chen Fu, Qing Xie, Collin McMillan...
— This paper addresses model reduction for a Markov chain on a large state space. A simulation-based framework is introduced to perform state aggregation of the Markov chain base...
The comprehensive understanding of today’s software systems is a daunting activity, because of the sheer size and complexity that such systems exhibit. Moreover, software system...