Sciweavers

2652 search results - page 238 / 531
» Privacy-preserving linear programming
Sort
View
NIPS
2003
15 years 5 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
AUTOMATICA
2008
60views more  AUTOMATICA 2008»
15 years 3 months ago
Control of nonstationary LPV systems
This paper considers control of nonstationary linear parameter-varying systems, and is motivated by interest in the control of nonlinear systems along prespecified trajectories. I...
Mazen Farhood, Geir E. Dullerud
130
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
ECOI
2006
59views more  ECOI 2006»
15 years 3 months ago
Model-building with interpolated temporal data
Ecological data can be difficult to collect, and as a result, some important temporal ecological datasets contain irregularly sampled data. Since many temporal modelling technique...
Robert I. McKay, Tuan Hao Hoang, Naoki Mori, Nguye...
137
Voted
SIAMJO
2008
212views more  SIAMJO 2008»
15 years 3 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera