58 search results - page 7 / 12 » How to Round Any CSP |
ICMCS
2006
IEEE
14 years 4 months ago
2006
IEEE
— In this paper, we propose a Reverse Frame Selection (RFS) scheme based on dynamic programming to solve for the problem of video streaming over VBR channels. In particular, we ï...
ISAAC
2001
Springer
14 years 3 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
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...
NDSS
2009
IEEE
14 years 5 months ago
2009
IEEE
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
SODA
2000
ACM
14 years 6 days ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...