3221 search results - page 247 / 645 » Termination of Linear Programs |
180
click to vote
INFORMS
1998
15 years 6 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
202
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
187
click to vote
ISPD
2004
ACM
15 years 12 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
170
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
179
click to vote
MP
2008
15 years 6 months ago
2008
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...