The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
Developers, like all modern knowledge workers, are frequently interrupted and blocked in their tasks. In this paper we present a contextual inquiry into developers’ current stra...
A reference architecture for a domain captures the fundamental subsystems common to systems of that domain as well as the relationships between these subsystems. Having a referenc...
We present MATCH, a toolkit for aligning audio recordings of different renditions of the same piece of music, based on an efficient implementation of a dynamic time warping algor...