202 search results - page 34 / 41 » An Analysis of Optimal Link Bombs |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
75
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system i...
CASES
2006
ACM
15 years 3 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
ESA
1999
Springer
15 years 2 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
114
click to vote
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...