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...
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...
An improved method for generalized constrained canonical correlation analysis (GCCANO) is proposed. In the original GCCANO, data matrices were first decomposed into the sum of sev...
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
—Bandwidth usage has become more complex such that it is not uncommon that multiple signals of appreciable power may be present within the same bandwidth. The presence of multipl...
John Weber, Kyle Kowalske, Clark Robertson, Frank ...