Sciweavers

19 search results - page 2 / 4
» An Adaptive Version of the Boost by Majority Algorithm
Sort
View
PR
2006
164views more  PR 2006»
13 years 5 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
CVPR
2005
IEEE
14 years 7 months ago
Boosting Saliency in Color Image Features
The aim of salient point detection is to find distinctive events in images. Salient features are generally determined from the local differential structure of images. They focus o...
Joost van de Weijer, Theo Gevers
FOCS
2010
IEEE
13 years 3 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
EOR
2010
149views more  EOR 2010»
13 years 5 months ago
Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
CVPR
2006
IEEE
14 years 7 months ago
Supervised Learning of Edges and Object Boundaries
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
Piotr Dollár, Zhuowen Tu, Serge Belongie