Sciweavers

119 search results - page 18 / 24
» Bounds on Codes Based on Graph Theory
Sort
View
91
Voted
IWCMC
2009
ACM
15 years 4 months ago
Multiple-antenna multiple-relay system with precoding for multiuser transmission
Multi-hop relaying will play a central role in next generation wireless systems. In this paper a novel relaying strategy that uses multiple-input multiple-output (MIMO) relays in ...
Arash Talebi, Witold A. Krzymien
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 1 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
PODC
2005
ACM
15 years 3 months ago
Facility location: distributed approximation
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
Thomas Moscibroda, Roger Wattenhofer
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 2 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 9 months ago
Unequal dimensional small balls and quantization on Grassmann Manifolds
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
Wei Dai, Brian Rider, Youjian Liu