Sciweavers

5793 search results - page 880 / 1159
» Individual communication complexity
Sort
View
DC
2007
15 years 5 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
CACM
2005
126views more  CACM 2005»
15 years 5 months ago
Extrovert gadgets
This paper presents a set of architectures for the composition of ubiquitous computing applications. It describes research that is being carried out in "extrovert-Gadgets&quo...
Achilles Kameas, Irene Mavrommati
JOC
2007
93views more  JOC 2007»
15 years 5 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
JSA
2000
115views more  JSA 2000»
15 years 5 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
ECCC
2010
98views more  ECCC 2010»
15 years 4 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi