Sciweavers

189 search results - page 21 / 38
» From Linear Relaxations to Global Constraint Propagation
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng
COR
2010
105views more  COR 2010»
13 years 7 months ago
Effective formulation reductions for the quadratic assignment problem
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
JAIR
2010
99views more  JAIR 2010»
13 years 6 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
CP
2009
Springer
14 years 8 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
CVPR
2011
IEEE
13 years 3 months ago
Shape from Specular Flow: Is One Flow Enough?
Specular flow is the motion field induced on the image plane by the movement of points reflected by a curved, mirror-like surface. This flow provides information about surface...
Yuriy Vasilyev, Todd Zickler, Steven Gortler, Ohad...