41 search results - page 7 / 9 » Strong Formulations for 2-Node-Connected Steiner Network Pro... |
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We define and study the scheduling complexity in wireless networks, which expresses the theoretically achievable efficiency of MAC layer protocols. Given a set of communicati...
BMCBI
2007
13 years 7 months ago
2007
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. There is an urgent need for sound approaches to integrative and collaborative analysis of large, autonomous (and hence, inevitably semantically heterogeneous) data source...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Accurately positioning nodes in wireless and sensor networks is important because the location of sensors is a critical input to many higher-level networking tasks. However, th...
BIOCOMP
2008
13 years 9 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...