57 search results - page 2 / 12 » Redundancy in All Pairs Fast Marching Method |
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
In this paper, we present a new method for segmenting closed contours and surfaces. Our work builds on a variant of the Fast Marching algorithm. First, an initial point on the des...
ICCAD
1991
IEEE
13 years 8 months ago
1991
IEEE
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
SMA
2003
ACM
13 years 10 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
EMMCVPR
2001
Springer
13 years 9 months ago
2001
Springer
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...