550 search results - page 109 / 110 » pairing 2009 |
ISAAC
2009
Springer
13 years 10 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
KDD
2009
ACM
13 years 10 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
GCB
2009
Springer
13 years 9 months ago
2009
Springer
Abstract: It is often challenging to reconstruct accurately a complete dynamic biological network due to the scarcity of data collected in cost-effective experiments. This paper ad...
GLOBECOM
2009
IEEE
13 years 9 months ago
2009
IEEE
The Internet growth coupled with the variety of its services is creating an increasing need for multicast traffic support by backbone routers and packet switches. Recently, buffere...
EDBT
2009
ACM
13 years 8 months ago
2009
ACM
In a world of wide-scale information sharing, the decentralized coordination has to consolidate a variety of heterogeneity. Shared data are described in different formats, i.e. da...