In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...