Sciweavers

67 search results - page 2 / 14
» Constructing Strictly Positive Families
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
13 years 9 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
SMI
2006
IEEE
122views Image Analysis» more  SMI 2006»
13 years 11 months ago
A Constrained Least Squares Approach to Interactive Mesh Deformation
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
Yasuhiro Yoshioka, Hiroshi Masuda, Yoshiyuki Furuk...
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 2 months ago
Optimal measures and transition kernels
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...
Roman V. Belavkin
JAPLL
2007
104views more  JAPLL 2007»
13 years 4 months ago
An axiomatization of family resemblance
We invoke concepts from the theory of hypergraphs to give a measure of the closeness of family resemblance, and to make precise the idea of a composite likeness. It is shown that f...
Ray E. Jennings, Dorian X. Nicholson
ADCM
2006
101views more  ADCM 2006»
13 years 5 months ago
A general construction of barycentric coordinates over convex polygons
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all baryc...
Michael S. Floater, Kai Hormann, Géza K&oac...