The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
In this paper, we present a semi-automatic approach to efficiently and robustly recover the characteristic feature curves of a given free-form surface. The technique supports a s...
Ellen Dekkers, Leif Kobbelt, Richard R. Pawlicki, ...
For non-rigid registration, the objects in medical images are usually treated as a single deformable body with homogeneous stiffness distribution. However, this assumption is inval...
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Traditional decode-and-forward cooperation systems consider dedicated relays, while instead we consider wireless transceivers that cooperatively relay signals in addition to prima...