1259 search results - page 121 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
245
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
163
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
The use of network coding has been shown to improve throughput in input-queued multicast switches, but not without costs of computational complexity and delays. In this paper, we i...
162
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: The aim of this study was to provide a framework for the analysis of visceral obesity and its determinants in women, where complex inter-relationships are observed amo...
164
click to vote
MOBISYS
2008
ACM
16 years 5 months ago
2008
ACM
Deployments of city-wide multi-hop 802.11 networks introduce challenges for maintaining client performance at vehicular speeds. We experimentally demonstrate that current network ...
171
click to vote
MOBIHOC
2005
ACM
16 years 5 months ago
2005
ACM
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...