Sciweavers

3250 search results - page 38 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
SIAMJO
2011
13 years 2 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
MP
2008
115views more  MP 2008»
13 years 8 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
14 years 3 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 6 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan