5214 search results - page 280 / 1043 » The Online Specialization Problem |
223
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
171
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
155
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
162
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
208
click to vote
ICCV
2007
IEEE
16 years 17 days ago
2007
IEEE
This paper treats tracking as a foreground/background classification problem and proposes an online semisupervised learning framework. Initialized with a small number of labeled ...