Sciweavers

1723 search results - page 36 / 345
» Cycling in linear programming problems
Sort
View
124
Voted
NIPS
2003
15 years 3 months ago
Multiple-Instance Learning via Disjunctive Programming Boosting
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
Stuart Andrews, Thomas Hofmann
JSAC
2008
70views more  JSAC 2008»
15 years 2 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 2 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
236
Voted
INFOCOM
2011
IEEE
14 years 5 months ago
Secure and practical outsourcing of linear programming in cloud computing
—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...
Cong Wang, Kui Ren, Jia Wang
EOR
2010
113views more  EOR 2010»
15 years 2 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis