1594 search results - page 38 / 319 » An Algorithm to Compute Collusion Paths |
105
click to vote
CAINE
2004
15 years 1 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
CG
2005
Springer
14 years 11 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
BMVC
2010
14 years 9 months ago
2010
We present a novel method to detect curves with unknown endpoints using minimal path techniques. Our work builds on the state of the art minimal path techniques currently used to ...
ICN
2005
Springer
15 years 5 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...