Sciweavers

570 search results - page 83 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
On Self-Similarity and Hamiltonicity of Dual-Cubes
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
Changfu Wu, Jie Wu
INFOCOM
2000
IEEE
14 years 1 months ago
Power Controlled Multiple Access (PCMA) in Wireless Communication Networks
—We address the issue of power-controlled shared channel access in future wireless networks supporting packetized data traffic, beyond the voice-oriented continuous traffic prima...
Nicholas Bambos, Sunil Kandukuri
MSWIM
2005
ACM
14 years 2 months ago
Content and service replication strategies in multi-hop wireless mesh networks
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
Shudong Jin, Limin Wang
JIB
2008
87views more  JIB 2008»
13 years 8 months ago
2.5D Visualisation of Overlapping Biological Networks
Biological data is often structured in the form of complex interconnected networks such as protein interaction and metabolic networks. In this paper, we investigate a new problem ...
David Cho Yau Fung, Seok-Hee Hong, Dirk Koschü...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner