Sciweavers

2974 search results - page 300 / 595
» Model-Driven Constraint Programming
Sort
View
ACL
2008
15 years 8 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
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...
ICPR
2006
IEEE
16 years 7 months ago
Bijective Image Registration using Thin-Plate Splines
Image registration is the process of geometrically aligning two or more images. In this paper we describe a method for registering pairs of images based on thin-plate spline mappi...
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...
GD
2007
Springer
16 years 24 days ago
Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
Tim Dwyer, Kim Marriott