Sciweavers

641 search results - page 42 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
ICIP
1999
IEEE
15 years 11 months ago
Distortion Analyses for Temporal Scalability Coding Techniques
A temporally scalable video coding algorithm allows extraction of video of multiple frame rates from a single coded stream. This paper compares the rate-distortion performance of ...
Sheila S. Hemami
JMLR
2011
137views more  JMLR 2011»
14 years 4 months ago
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
In this paper the sequential prediction problem with expert advice is considered for the case where losses of experts suffered at each step cannot be bounded in advance. We presen...
Vladimir V. V'yugin
AIRS
2008
Springer
14 years 11 months ago
Efficient Feature Selection in the Presence of Outliers and Noises
Although regarded as one of the most successful algorithm to identify predictive features, Relief is quite vulnerable to outliers and noisy features. The recently proposed I-Relief...
Shuang-Hong Yang, Bao-Gang Hu
JMLR
2002
115views more  JMLR 2002»
14 years 9 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
ICML
2005
IEEE
15 years 10 months ago
Using additive expert ensembles to cope with concept drift
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
Jeremy Z. Kolter, Marcus A. Maloof