3134 search results - page 46 / 627 » Computing full disjunctions |
AI
2005
Springer
13 years 9 months ago
2005
Springer
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
SCALESPACE
2005
Springer
14 years 3 months ago
2005
Springer
Variational methods are very popular for optic flow computation: They yield dense flow fields and perform well if they are adapted such that they respect discontinuities in the ...
ICDT
2009
ACM
14 years 10 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
RTA
2010
Springer
14 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
CASC
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...