7133 search results - page 1111 / 1427 » Communication algorithms with advice |
172
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
182
click to vote
COCO
2003
Springer
16 years 21 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
232
click to vote
STOC
2009
ACM
16 years 8 months ago
2009
ACM
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
210
Voted
SPAA
2009
ACM
16 years 8 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
232
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...