EMMCVPR
2011
Springer
13 years 14 days ago
2011
Springer
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
TCAD
2011
13 years 7 months ago
2011
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
COLING
2010
13 years 7 months ago
2010
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
EUSFLAT
2009
13 years 10 months ago
2009
Abstract-- In this paper, we deal with the production and transportation planning of a household appliances manufacturer that has production facilities and central stores for resel...
ACL
2010
2010
Minimized Models and Grammar-Informed Initialization for Supertagging with Highly Ambiguous Lexicons
13 years 10 months ago
We combine two complementary ideas for learning supertaggers from highly ambiguous lexicons: grammar-informed tag transitions and models minimized via integer programming. Each st...
IDA
2000
Springer
14 years 16 days ago
2000
Springer
The discovery of characteristic rules is a well-known data mining task and has lead to several successful applications. However, because of the descriptive nature of characteristic...
4OR
2004
14 years 18 days ago
2004
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
MP
2006
14 years 20 days ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
JAIR
2008
14 years 21 days ago
2008
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
EOR
2006
14 years 22 days ago
2006
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...