1594 search results - page 81 / 319 » An Algorithm to Compute Collusion Paths |
124
click to vote
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
107
click to vote
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
107
click to vote
ICRA
2005
IEEE
15 years 8 months ago
2005
IEEE
— The E∗ algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of ...
178
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
109
click to vote
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...