393 search results - page 58 / 79 » On the Convergence of Boosting Procedures |
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the geometric median of data on a Riemannian manifold as ...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
Abstract. The ability to learn from user interaction is an important asset for content-based image retrieval (CBIR) systems. Over short times scales, it enables the integration of ...