Sciweavers

887 search results - page 91 / 178
» A Time for Choosing
Sort
View
ICML
2009
IEEE
14 years 10 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
14 years 10 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
14 years 10 months ago
Incorporating Diversity in Active Learning with Support Vector Machines
In many real world applications, active selection of training examples can significantly reduce the number of labelled training examples to learn a classification function. Differ...
Klaus Brinker
PLDI
2009
ACM
14 years 9 months ago
Chameleon: adaptive selection of collections
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...
Ohad Shacham, Martin T. Vechev, Eran Yahav
DCC
2009
IEEE
14 years 9 months ago
H.264/MPEG-4 AVC Encoder Parameter Selection Algorithms for Complexity Distortion Tradeoff
The H.264 encoder has input parameters that determine the bit rate and distortion of the compressed video and the encoding complexity. A set of encoder parameters is referred to a...
Rahul Vanam, Eve A. Riskin, Richard E. Ladner