44 search results - page 9 / 9 » Maximizing the Number of Packed Rectangles |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
SPAA
2010
ACM
14 years 5 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
SASO
2010
IEEE
13 years 5 months ago
2010
IEEE
Server consolidation through virtualization is becoming an effective way to save power and space in enterprise data centers. However, it also brings additional operational risks f...
TIT
2011
13 years 2 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...