Sciweavers

1494 search results - page 271 / 299
» Polynomial time algorithms for network information flow
Sort
View
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 2 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
WSC
1997
13 years 10 months ago
Model-Driven Simulation of World-Wide-Web Cache Policies
The World Wide Web (WWW) has experienced a dramatic increase in popularity since 1993. Many reports indicate that its growth will continue at an exponential rate. This growth has ...
Ying Shi, Edward Watson, Ye-Sho Chen
SOCINFO
2010
13 years 7 months ago
Dynamic Context-Sensitive PageRank for Expertise Mining
Abstract. Online tools for collaboration and social platforms have become omnipresent in Web-based environments. Interests and skills of people evolve over time depending in perfor...
Daniel Schall, Schahram Dustdar
INFOCOM
2009
IEEE
14 years 3 months ago
Estimating Hop Distance Between Arbitrary Host Pairs
—Establishing a clear and timely picture of Internet topology is complicated by many factors including the vast size and dynamic nature of the infrastructure. In this paper, we d...
Brian Eriksson, Paul Barford, Robert D. Nowak
CCS
2004
ACM
14 years 2 months ago
Web tap: detecting covert web traffic
As network security is a growing concern, system administrators lock down their networks by closing inbound ports and only allowing outbound communication over selected protocols ...
Kevin Borders, Atul Prakash