Sciweavers

62 search results - page 13 / 13
» Optimizing the cost matrix for approximate string matching u...
Sort
View
CORR
2011
Springer
220views Education» more  CORR 2011»
12 years 11 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
13 years 9 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani