1431 search results - page 54 / 287 » Solving Constraints in Model Transformations |
133
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
105
click to vote
WEBI
2007
Springer
15 years 6 months ago
2007
Springer
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
132
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
100
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
96
Voted
PR
2006
2006
Correspondence matching using kernel principal components analysis and label consistency constraints
15 years 14 days ago
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how ker...