Sciweavers

686 search results - page 57 / 138
» Minimax Probability Machine
Sort
View
IOR
2002
135views more  IOR 2002»
13 years 10 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
ICML
2006
IEEE
14 years 11 months ago
Permutation invariant SVMs
We extend Support Vector Machines to input spaces that are sets by ensuring that the classifier is invariant to permutations of subelements within each input. Such permutations in...
Pannagadatta K. Shivaswamy, Tony Jebara
ECML
2007
Springer
14 years 4 months ago
On Phase Transitions in Learning Sparse Networks
In this paper we study the identification of sparse interaction networks as a machine learning problem. Sparsity means that we are provided with a small data set and a high number...
Goele Hollanders, Geert Jan Bex, Marc Gyssens, Ron...
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 10 months ago
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
Guolong Lin, Rajmohan Rajaraman
ICML
2009
IEEE
14 years 11 months ago
Archipelago: nonparametric Bayesian semi-supervised learning
Semi-supervised learning (SSL), is classification where additional unlabeled data can be used to improve accuracy. Generative approaches are appealing in this situation, as a mode...
Ryan Prescott Adams, Zoubin Ghahramani