12052 search results - page 512 / 2411 » computing 2010 |
183
click to vote
CGF
2010
15 years 7 months ago
2010
We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open ...
231
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
185
click to vote
CGF
2010
15 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 ...
194
click to vote
CCDS
2010
15 years 4 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
156
click to vote
ICMS
2010
15 years 4 months ago
2010
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...