89 search results - page 13 / 18 » CP Models for Maximum Common Subgraph Problems |
90
Voted
IBPRIA
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
GRAMMARS
2002
14 years 9 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
KDD
2005
ACM
15 years 2 months ago
2005
ACM
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...