388 search results - page 43 / 78 » Robust Lower Bounds for Communication and Stream Computation |
149
click to vote
MM
2006
ACM
16 years 1 days ago
2006
ACM
Expressing and analysing data dependency in multimedia streams is promising, since content-aware policies at a transport level would benefit from such services. In this paper we ...
175
Voted
PODC
2006
ACM
16 years 1 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
237
click to vote
MOBISYS
2009
ACM
16 years 6 months ago
2009
ACM
An important feature of a modern mobile device is that it can position itself. Not only for use on the device but also for remote applications that require tracking of the device....
154
Voted
CRYPTO
2000
Springer
15 years 10 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. ...
159
click to vote
PPOPP
2005
ACM
15 years 11 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...