Sciweavers

1859 search results - page 61 / 372
» Sketch-based path design
Sort
View
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 7 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
HASE
2007
IEEE
14 years 3 months ago
SyncProbe: Providing Assurance of Message Latency through Predictive Monitoring of Internet Paths
SyncProbe improves the end-to-end predictability of distributed systems by providing applications with a real-time estimate of the maximum expected message delay (upper bound on c...
Jawwad Shamsi, Monica Brockmeyer
IEEEPACT
2006
IEEE
14 years 3 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
SIGCOMM
2004
ACM
14 years 2 months ago
SPV: secure path vector routing for securing BGP
As our economy and critical infrastructure increasingly relies on the Internet, the insecurity of the underlying border gateway routing protocol (BGP) stands out as the Achilles h...
Yih-Chun Hu, Adrian Perrig, Marvin A. Sirbu
ICASSP
2010
IEEE
13 years 9 months ago
Camera-based clear path detection
In using image analysis to assist a driver to avoid obstacles on the road, traditional approaches rely on various detectors designed to detect different types of objects. We propo...
Qi Wu, Wende Zhang, Tsuhan Chen, B. V. K. Vijaya K...