58 search results - page 3 / 12 » Network Flow Algorithms for Structured Sparsity |
DAC
1996
ACM
13 years 10 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
NETWORKS
2010
13 years 4 months ago
2010
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
BMCBI
2011
12 years 9 months ago
2011
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic ...
BMCBI
2007
13 years 6 months ago
2007
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...
NETWORKS
2008
13 years 5 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...