Sciweavers

350 search results - page 27 / 70
» On the symmetry function of a convex set
Sort
View
CORR
2011
Springer
133views Education» more  CORR 2011»
14 years 2 months ago
Minimizing the sum of many rational functions
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
Florian Bugarin, Didier Henrion, Jean B. Lasserre
MOR
2010
79views more  MOR 2010»
14 years 5 months ago
A Geometric Proof of Calibration
We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and ...
Shie Mannor, Gilles Stoltz
IJCNN
2006
IEEE
15 years 5 months ago
Learning the Kernel in Mahalanobis One-Class Support Vector Machines
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
Ivor W. Tsang, James T. Kwok, Shutao Li
84
Voted
IPMU
2010
Springer
15 years 3 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
SIAMJO
2010
108views more  SIAMJO 2010»
14 years 9 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer