31 search results - page 5 / 7 » How Good are Convex Hull Algorithms |
151
click to vote
ASIAN
2006
Springer
15 years 7 months ago
2006
Springer
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
132
click to vote
MP
2006
15 years 3 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
117
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
138
click to vote
PR
2008
15 years 3 months ago
2008
The computation of a shape's orientation is a common task in the area of computer vision and image processing, being used for example to define a local frame of reference and...
116
click to vote
CSDA
2007
15 years 3 months ago
2007
Of interest here are linear data fitting problems with uncertain data which lie in a given uncertainty set. A robust counterpart of such a problem may be interpreted as the probl...