1594 search results - page 56 / 319 » An Algorithm to Compute Collusion Paths |
FOCS
1994
IEEE
15 years 3 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
113
click to vote
ISCAPDCS
2003
15 years 1 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
124
click to vote
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
106
click to vote
EURODAC
1994
IEEE
15 years 4 months ago
1994
IEEE
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
In this paper, we present a method for acquiring, spatially filtering and viewing annotated videos captured with a full field of view multi-head camera moving along a path. We des...