2286 search results - page 128 / 458 » Algorithms for Categorical Equivalence |
160
click to vote
ACL
2008
15 years 7 months ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
132
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
143
click to vote
ORDER
2002
15 years 5 months ago
2002
In this article we describe a very efficient method to construct pairwise nonisomorphic posets (equivalently, T0 topologies). We also give the results obtained by a computer progr...
184
click to vote
DLOG
2011
14 years 9 months ago
2011
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
137
click to vote
ICDM
2009
IEEE
16 years 21 days ago
2009
IEEE
—Segmentation, the task of splitting a long sequence of discrete symbols into chunks, can provide important information about the nature of the sequence that is understandable to...