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...
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
A linear programming technique is introduced that jointly performs feature selection and classifier training so that a subset of features is optimally selected together with the c...
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...