524 search results - page 85 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—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...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Adaptive rate/power control schemes have great potential to increase the throughput of wireless CDMA networks. In this paper, we investigate the additional gains achiev...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
GLOBECOM
2009
IEEE
2009
IEEE
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
13 years 11 months ago
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...