Sciweavers

2403 search results - page 101 / 481
» Optimal Randomized RANSAC
Sort
View
EOR
2010
113views more  EOR 2010»
15 years 16 days ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
CVPR
2011
IEEE
14 years 11 months ago
Learning Non-Local Range Markov Random Field for Image Restoration
In this paper, we design a novel MRF framework which is called Non-Local Range Markov Random Field (NLRMRF). The local spatial range of clique in traditional MRF is extended to th...
Sun Jian, Marshall Tappen
TMI
2010
206views more  TMI 2010»
14 years 10 months ago
Random Subspace Ensembles for fMRI Classification
Classification of brain images obtained through functional magnetic resonance imaging (fMRI) poses a serious challenge to pattern recognition and machine learning due to the extrem...
Ludmila I. Kuncheva, Juan José Rodrí...
ICML
2010
IEEE
15 years 4 months ago
Efficient Selection of Multiple Bandit Arms: Theory and Practice
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
Shivaram Kalyanakrishnan, Peter Stone
EOR
2010
116views more  EOR 2010»
15 years 3 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...