Sciweavers

263 search results - page 52 / 53
» Minimum Entropy Coloring
Sort
View
INFOCOM
2005
IEEE
13 years 11 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
DAM
2010
137views more  DAM 2010»
13 years 5 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
IJRR
2007
104views more  IJRR 2007»
13 years 5 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 4 months ago
Cooperative Algorithms for MIMO Interference Channels
Interference alignment is a transmission technique for exploiting all available degrees of freedom in the symmetric frequency- or time-selective interference channel with an arbit...
Steven W. Peters, Robert W. Heath Jr.
TSP
2010
13 years 13 days ago
Communications-inspired sensing: a case study on waveform design
Information theory, and particularly the mutual information (MI), has provided fundamental guidance for communications research. In Bell's 1993 paper, the MI was first applied...
Wenshu Zhang, Liuqing Yang