1425 search results - page 155 / 285 » Beyond Dependency Graphs |
WEA
2009
Springer
14 years 3 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ISMAR
2008
IEEE
14 years 2 months ago
2008
IEEE
Ubiquitous Tracking (Ubitrack) setups, consisting of many previously unknown sensors, offer many possibilities to perform sensor fusion in order to increase robustness and accurac...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
ECTEL
2007
Springer
14 years 2 months ago
2007
Springer
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...