89 search results - page 10 / 18 » CP Models for Maximum Common Subgraph Problems |
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
106
click to vote
ALGORITHMICA
2008
14 years 9 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
ACSAC
2003
IEEE
15 years 2 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
119
click to vote
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a novel approach to compute the similarity between two unordered variable-sized vector sets. To solve this problem, several authors have proposed to model each vector s...