Sciweavers

356 search results - page 5 / 72
» On the Global Solution of Linear Programs with Linear Comple...
Sort
View
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 2 months ago
Computation reuse for rigid-body dynamics
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
Anne Loomis, Devin J. Balkcom
JAIR
2008
136views more  JAIR 2008»
13 years 8 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
ANNPR
2006
Springer
14 years 12 days ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe
DAC
2002
ACM
14 years 9 months ago
Watermarking integer linear programming solutions
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...
Seapahn Megerian, Milenko Drinic, Miodrag Potkonja...
EACL
2009
ACL Anthology
13 years 6 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud