5122 search results - page 81 / 1025 » Comparing Consequence Relations |
APPINF
2003
13 years 11 months ago
2003
XML data is often modeled as node-labeled trees. In a structure-generic relational storage scheme, the structure of the XML data is shredded into pieces of a generic type, such as...
ACL
2010
13 years 8 months ago
2010
A challenging problem in open information extraction and text mining is the learning of the selectional restrictions of semantic relations. We propose a minimally supervised boots...
ML
2011
ACM
13 years 5 months ago
2011
ACM
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
ICSM
1996
IEEE
14 years 2 months ago
1996
IEEE
: Object-oriented technology has become mature enough to satisfy many new requirements coming from areas like computer-aided design (CAD), computer-integrated manufacturing (CIM), ...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...