1594 search results - page 59 / 319 » An Algorithm to Compute Collusion Paths |
138
click to vote
IPL
2008
15 years 2 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
112
click to vote
PODC
2003
ACM
15 years 8 months ago
2003
ACM
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
146
Voted
ALGORITHMICA
2011
14 years 10 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
114
Voted
ICNP
1997
IEEE
15 years 6 months ago
1997
IEEE
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
A meaningful affinity measure between pixels is essential for many computer vision and image processing applications. We propose an algorithm that works in the features' hist...