597 search results - page 41 / 120 » Homomorphisms of random paths |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
ET
2000
14 years 9 months ago
2000
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
115
click to vote
ISCA
2012
IEEE
13 years 4 days ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...