Sciweavers

1814 search results - page 60 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CVPR
2010
IEEE
1135views Computer Vision» more  CVPR 2010»
14 years 4 months ago
Towards Weakly Supervised Semantic Segmentation by Means of Multiple Instance and Multitask Learning.
We address the task of learning a semantic segmentation from weakly supervised data. Our aim is to devise a system that predicts an object label for each pixel by making use of on...
Alexander Vezhnevets, Joachim Buhmann
NECO
2006
157views more  NECO 2006»
13 years 9 months ago
Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
Durga L. Shrestha, Dimitri P. Solomatine
HM
2010
Springer
146views Optimization» more  HM 2010»
13 years 9 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 10 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
EOR
2008
90views more  EOR 2008»
13 years 9 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...