287 search results - page 54 / 58 » Communication complexity as a lower bound for learning in ga... |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
JACM
2006
13 years 7 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...
SPAA
2003
ACM
14 years 21 days ago
2003
ACM
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...
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
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. ...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
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...