1986 search results - page 381 / 398 » Path Separability of Graphs |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
PDPTA
2000
13 years 8 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
UAI
2007
13 years 8 months ago
2007
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
TLDI
2010
ACM
13 years 7 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
BMCBI
2010
13 years 7 months ago
2010
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...