1986 search results - page 277 / 398 » Path Separability of Graphs |
158
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
135
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
109
click to vote
WWW
2009
ACM
16 years 3 months ago
2009
ACM
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
122
click to vote
WABI
2009
Springer
15 years 9 months ago
2009
Springer
Background: This paper considers the problem of identifying pathways through metabolic networks that relate to a specific biological response. Our proposed model, HME3M, first ide...
154
Voted
ISCAS
2008
IEEE
15 years 9 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...