224 search results - page 4 / 45 » Auctions with Severely Bounded Communication |
SIGCOMM
1995
ACM
13 years 11 months ago
1995
ACM
In most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. T...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
MOBIHOC
2009
ACM
14 years 7 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
CANS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for additi...