Sciweavers

697 search results - page 47 / 140
» Convex Functions on Discrete Sets
Sort
View
CORR
2011
Springer
133views Education» more  CORR 2011»
13 years 12 days 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»
13 years 3 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
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 22 days ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
IJCNN
2006
IEEE
14 years 2 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
CDC
2010
IEEE
134views Control Systems» more  CDC 2010»
13 years 3 months ago
Observer design for Lipschitz systems with discrete-time measurements
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
Vincent Andrieu, Madiha Nadri