In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
Fabian W. Meier, Guido M. Schuster, Aggelos K. Kat...
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that capture...
We define a number of original encodings that map MaxCSP instances into Partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into...
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...