Sciweavers

1336 search results - page 80 / 268
» SMTP Path Analysis
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 6 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
INFOCOM
2008
IEEE
16 years 18 days ago
MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes
—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...
Vicky Sharma, Shivkumar Kalyanaraman, Koushik Kar,...
SPAA
2005
ACM
15 years 11 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 4 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
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...
Yuxin Chen, Jeffrey Andrews
ESANN
2004
15 years 7 months ago
A biologically plausible neuromorphic system for object recognition and depth analysis
Abstract. We present a large-scale Neuromorphic model based on integrateand-fire (IF) neurons that analyses objects and their depth within a moving visual scene. A feature-based al...
Zhijun Yang, Alan F. Murray