835 search results - page 106 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
IPL
2006
13 years 10 months ago
2006
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
PAMI
2012
12 years 1 months ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a highdimensional data matrix despite both small entry-wise noise and gross spar...
ICML
2006
IEEE
14 years 11 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
AIPS
2000
14 years 4 days ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...