9886 search results - page 1567 / 1978 » Learning Compressible Models |
174
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
192
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The goal of feature induction is to automatically create nonlinear combinations of existing features as additional input features to improve classification accuracy. Typically, no...
185
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
198
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
190
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...