1450 search results - page 250 / 290 » On the Complexity of Hardness Amplification |
104
click to vote
IMC
2003
ACM
15 years 3 months ago
2003
ACM
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
ISLPED
2003
ACM
15 years 3 months ago
2003
ACM
Ever shrinking device sizes and innovative micro-architectural and circuit design techniques have made it possible to have multi-million transistor systems running at multi-gigahe...
105
click to vote
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
MOBICOM
2003
ACM
15 years 3 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...