The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...