Sciweavers

181 search results - page 7 / 37
» Online promise problems with online width metrics
Sort
View
ICML
2003
IEEE
15 years 10 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
STACS
2004
Springer
15 years 2 months ago
Topology Matters: Smoothed Competitiveness of Metrical Task Systems
We consider metrical task systems, a general framework to model online problems. Borodin, Linial and Saks [BLS92] presented a deterministic work function algorithm (WFA) for metric...
Guido Schäfer, Naveen Sivadasan
CORR
2008
Springer
136views Education» more  CORR 2008»
14 years 9 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
FGCS
2008
135views more  FGCS 2008»
14 years 9 months ago
An on-line replication strategy to increase availability in Data Grids
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
Ming Lei, Susan V. Vrbsky, Xiaoyan Hong
ICCV
2003
IEEE
15 years 11 months ago
Background Modeling and Subtraction of Dynamic Scenes
Background modeling and subtraction is a core component in motion analysis. The central idea behind such module is to create a probabilistic representation of the static scene tha...
Antoine Monnet, Anurag Mittal, Nikos Paragios, Vis...