89 search results - page 7 / 18 » CP Models for Maximum Common Subgraph Problems |
ESOP
2001
Springer
15 years 1 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
113
Voted
DAGM
2011
Springer
13 years 9 months ago
2011
Springer
Conditional Random Fields (CRFs) are popular models in computer vision for solving labeling problems such as image denoising. This paper tackles the rarely addressed but important ...
JCP
2006
14 years 9 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
91
Voted
SIAMIS
2010
14 years 4 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
JMLR
2011
14 years 4 months ago
2011
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...