1594 search results - page 67 / 319 » An Algorithm to Compute Collusion Paths |
142
click to vote
SCALESPACE
2009
Springer
15 years 9 months ago
2009
Springer
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
125
Voted
COMPGEOM
1990
ACM
15 years 7 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
110
click to vote
EMSOFT
2006
Springer
15 years 6 months ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...
129
Voted
CIAC
2000
Springer
15 years 7 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
174
click to vote
ACCV
2009
Springer
15 years 9 months ago
2009
Springer
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...