Sciweavers

3600 search results - page 382 / 720
» The settling-time reducibility ordering
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICML
2005
IEEE
16 years 7 months ago
Active learning for sampling in time-series experiments with application to gene expression analysis
Many time-series experiments seek to estimate some signal as a continuous function of time. In this paper, we address the sampling problem for such experiments: determining which ...
Rohit Singh, Nathan Palmer, David K. Gifford, Bonn...
ICML
2003
IEEE
16 years 7 months ago
Text Bundling: Statistics Based Data-Reduction
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
Lawrence Shih, Jason D. Rennie, Yu-Han Chang, Davi...
ICML
2002
IEEE
16 years 7 months ago
Adaptive View Validation: A First Step Towards Automatic View Detection
Multi-view algorithms reduce the amount of required training data by partitioning the domain features into separate subsets or views that are sufficient to learn the target concep...
Ion Muslea, Steven Minton, Craig A. Knoblock
ICML
1999
IEEE
16 years 7 months ago
Making Better Use of Global Discretization
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...
Eibe Frank, Ian H. Witten