165 search results - page 20 / 33 » Parallel Algorithm for Computing Reversal Distance |
118
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
128
click to vote
ICPP
2006
IEEE
15 years 8 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
124
click to vote
DCOSS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
140
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
ISPAN
1999
IEEE
15 years 6 months ago
1999
IEEE
Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid twodimensional square diagonal tori for massively parallel computers with u...