Sciweavers

501 search results - page 89 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 3 months ago
fP2P-HN: A P2P-Based Route Optimization Solution for Mobile IP and NEMO Clients
— Wireless technologies are rapidly evolving and the users are demanding the possibility of changing its point of attachment to the Internet (i.e. default router) without breakin...
Albert Cabellos-Aparicio, Rubén Cuevas Rum&...
SPAA
2003
ACM
14 years 2 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
ICALP
2009
Springer
14 years 9 months ago
A Distributed and Oblivious Heap
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
Christian Scheideler, Stefan Schmid