133 search results - page 24 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
SIGECOM
2009
ACM
14 years 1 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
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...
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
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...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...