Sciweavers

254 search results - page 51 / 51
» On randomized one-round communication complexity
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 5 months ago
Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
Allen Chuang, Albert Guillen i Fabregas, Lars K. R...
EAAI
2007
154views more  EAAI 2007»
13 years 5 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
JOC
2007
94views more  JOC 2007»
13 years 5 months ago
On Unconditionally Secure Distributed Oblivious Transfer
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
Carlo Blundo, Paolo D'Arco, Alfredo De Santis, Dou...