Sciweavers

1707 search results - page 153 / 342
» Early Integer Programming
Sort
View
COCOA
2010
Springer
15 years 12 days ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
91
Voted
COLING
2010
14 years 9 months ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
CPAIOR
2011
Springer
14 years 6 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
EMNLP
2011
14 years 2 months ago
Exact Decoding of Phrase-Based Translation Models through Lagrangian Relaxation
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
Yin-Wen Chang, Michael Collins
126
Voted
ECCV
2008
Springer
16 years 4 months ago
Finding Actions Using Shape Flows
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...
Hao Jiang, David R. Martin