Sciweavers

111 search results - page 17 / 23
» First Order Reasoning on a Large Ontology
Sort
View
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 3 days ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
JMLR
2010
192views more  JMLR 2010»
14 years 6 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
14 years 9 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
AH
2008
Springer
15 years 6 months ago
Collection Browsing through Automatic Hierarchical Tagging
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
Korinna Bade, Marcel Hermkes
GI
2007
Springer
15 years 5 months ago
Achieving Semantic Interoperability By Using Complex Event Processing Technology
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...
Margarete Donovang-Kuhlisch