Sciweavers

2652 search results - page 93 / 531
» Path Differentials and Applications
Sort
View
CIKM
2009
Springer
15 years 11 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
TAMC
2009
Springer
15 years 10 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
INFOCOM
1997
IEEE
15 years 8 months ago
A Distributed Algorithm for Delay-Constrained Unicast Routing
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
Hussein F. Salama, Douglas S. Reeves, Yannis Vinio...
AICT
2006
IEEE
15 years 8 months ago
Classification of service for entertainment applications in vehicles
Generally, the real-time applications exchange information on dedicated network and the other traffic is supported by another communication system. The differentiation of these tw...
Jean-Philippe Georges, Eric Rondeau, Thierry Divou...
AIS
2000
Springer
15 years 4 months ago
The Evolve project: Component-based tailorability for CSCW applications
Tailorability is generally regarded as a key property of groupware systems due to the dynamics and differentiation of cooperative work. This article investigates the use of softwa...
Oliver Stiemerling, Armin B. Cremers