Sciweavers

273 search results - page 7 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Max-Margin Hidden Conditional Random Fields for Human Action Recognition
We present a new method for classification with structured latent variables. Our model is formulated using the max-margin formalism in the discriminative learning literature. We...
Yang Wang 0003, Greg Mori
IPCO
2007
143views Optimization» more  IPCO 2007»
13 years 9 months ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
IPSN
2005
Springer
14 years 1 months ago
Detecting cuts in sensor networks
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...
Nisheeth Shrivastava, Subhash Suri, Csaba D. T&oac...
CCE
2005
13 years 7 months ago
Phenotype phase plane analysis using interior point methods
Phenotype phase plane analysis is a linear optimization procedure which can be used to study the value of the objective function (a desired phenotype) as two variables (external s...
Steven L. Bell, Bernhard O. Palsson
COMPGEOM
2010
ACM
14 years 17 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir