5169 search results - page 560 / 1034 » Locality approximation using time |
188
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
198
click to vote
GLOBECOM
2009
IEEE
16 years 2 months ago
2009
IEEE
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
200
click to vote
QEST
2009
IEEE
16 years 2 months ago
2009
IEEE
—Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial...
171
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
As modern computing clusters used in scientific computing applications scale to ever-larger sizes and capabilities, their operational energy costs have become prohibitive. While ...
181
click to vote
ISCC
2007
IEEE
16 years 1 months ago
2007
IEEE
A long horizon end-to-end delay forecast, if possible, will be a breakthrough in traffic engineering. This paper introduces a hybrid approach to forecast end-to-end delays using ...