43 search results - page 7 / 9 » Linear Programming and Convex Hulls Made Easy |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
AUTOMATICA
2008
13 years 7 months 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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
WWW
2001
ACM
14 years 8 months ago
2001
ACM
This paper describes new technology based on on-line decision support for providing personalized customer treatments in web-based storefronts and information sites. The central im...