Sciweavers

23 search results - page 5 / 5
» On the knapsack closure of 0-1 Integer Linear Programs
Sort
View
ACL
2008
13 years 6 months ago
Enforcing Transitivity in Coreference Resolution
A desirable quality of a coreference resolution system is the ability to handle transitivity constraints, such that even if it places high likelihood on a particular mention being...
Jenny Rose Finkel, Christopher D. Manning
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 10 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
DAC
2006
ACM
14 years 5 months ago
BoxRouter: a new global router based on box expansion and progressive ILP
In this paper, we propose a new global router, BoxRouter, powered by the concept of box expansion and progressive integer linear programming (ILP). BoxRouter first uses a simple P...
Minsik Cho, David Z. Pan