364 search results - page 39 / 73 » On the generalization of soft margin algorithms |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
MCS
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Boosting methods are known to improve generalization performances of learning algorithms reducing both bias and variance or enlarging the margin of the resulting multi-cl...
CIVR
2008
Springer
13 years 9 months ago
2008
Springer
As the consequence of semantic gap, visual similarity does not guarantee semantic similarity, which in general is conflicting with the inherent assumption of many generativebased ...
NIPS
2008
13 years 9 months ago
2008
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...