299 search results - page 46 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
CP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
ANOR
2005
13 years 7 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
CGF
2010
13 years 7 months ago
2010
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...
JUCS
2007
13 years 7 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
TVCG
2008
13 years 7 months ago
2008
Computing smooth and optimal one-to-one maps between surfaces of same topology is a fundamental problem in graphics and such a method provides us a ubiquitous tool for geometric mo...