Sciweavers

2796 search results - page 105 / 560
» The coolest path problem
Sort
View
CIKM
2010
Springer
15 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SOSP
2003
ACM
16 years 1 months ago
User-level internet path diagnosis
Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consid...
Ratul Mahajan, Neil T. Spring, David Wetherall, Th...
ICNP
2002
IEEE
15 years 10 months ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
ICIP
2004
IEEE
16 years 6 months ago
MDC and path diversity in video streaming
Delivering multimedia content over the network pose several challenges that include higher bandwidth and sensitivity to packet losses resulting due to congestion and/or transmissi...
Siva Somasundaram, Koduvayur P. Subbalakshmi, R. N...
147
Voted
ISPASS
2006
IEEE
15 years 11 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...