2294 search results - page 423 / 459 » From Path Graphs to Directed Path Graphs |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
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 ...
WADS
2001
Springer
14 years 1 months ago
2001
Springer
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...
BMCBI
2006
13 years 9 months ago
2006
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...
IJSI
2008
13 years 9 months ago
2008
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...
ACL
2009
13 years 6 months ago
2009
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...