20 search results - page 4 / 4 » An upper bound on the average size of silhouettes |
ISCA
1992
IEEE
13 years 10 months ago
1992
IEEE
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...
WCNC
2008
IEEE
14 years 16 days ago
2008
IEEE
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
INFOCOM
2009
IEEE
14 years 24 days ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
SIAMDM
2008
13 years 6 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
CDC
2008
IEEE
14 years 19 days ago
2008
IEEE
— Given a fixed network where each node has some given initial value, and under the constraint that each node receives noisy transmissions from its immediate neighbors, we provi...