89 search results - page 4 / 18 » CP Models for Maximum Common Subgraph Problems |
ICMLA
2009
13 years 8 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
CP
2009
Springer
14 years 5 months ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
WWW
2011
ACM
13 years 5 months ago
2011
ACM
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
IPM
2008
13 years 11 months ago
2008
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...
NLPRS
2001
Springer
14 years 3 months ago
2001
Springer
In this project report we describe work in statistical parsing using the maximum entropy technique and the Alpino language analysis system for Dutch. A major difficulty in this d...