Sciweavers

2816 search results - page 37 / 564
» Submodular function minimization
Sort
View
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 10 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
ICML
2008
IEEE
14 years 11 months ago
Graph transduction via alternating minimization
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
Jun Wang, Tony Jebara, Shih-Fu Chang
ICCAD
1997
IEEE
133views Hardware» more  ICCAD 1997»
14 years 3 months ago
Functional simulation using binary decision diagrams
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...
Christoph Scholl, Rolf Drechsler, Bernd Becker
JMLR
2006
150views more  JMLR 2006»
13 years 11 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
CVPR
2010
IEEE
14 years 7 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar