608 search results - page 56 / 122 » On Dependent Randomized Rounding Algorithms |
SACRYPT
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
ICAS
2005
IEEE
14 years 2 months ago
2005
IEEE
Queue management, bandwidth share, and congestion control are very important to both robustness and fairness of the Internet. In this article, we investigate the problem of provid...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
JCP
2007
13 years 8 months ago
2007
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...