808 search results - page 112 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
94
Voted
CSCLP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
95
Voted
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...
78
Voted
ARITH
2007
IEEE
15 years 7 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
139
Voted
ESA
1995
Springer
15 years 4 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
107
click to vote
AUTOMATICA
2008
15 years 22 days ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...