We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and disequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez and McAloon. We show that deciding consistency of a set of constraints in this class can be done in po...

Existing vertex-based operational rate-distortion (ORD) optimal shape coding algorithms can use a number of different distortion measurement techniques, including the shortest absolute distance (SAD), the distortion band (DB), the tolerance band (TB), and the accurate distortion measurement technique for shape coding (ADMSC). From a computational time perspective, an -point contour requires ( )...

While the worst-case computational properties of Allen's calculus for qualitative temporal reasoning have been analyzed quite extensively, the determination of the empirical eeciency of algorithms for solving the consistency problem in this calculus has received only little research attention. In this paper, we will demonstrate that using the ORD-Horn class in Ladkin and Reinefeld's backtrackin...

This paper continues Nebel and B urckert's investigation of Allen's interval algebra by presenting nine more maximal tractable subclasses of the algebra (provided that P 6 = NP), in addition to their previously reported ORD-Horn subclass. Furthermore, twelve tractable subclasses are identiied, whose maximality is not decided. Four of these can express the notion of sequentiality between interva...

We introduce two new tractable temporal constraint languages, which both strictly contain the Ord-Horn language of Bürkert and Nebel. The algorithm we present for these languages decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) the two languages cannot be solved by Datalog or by establishing local consiste...

Ordered sheaves on a small quantaloid Q have been defined in terms of Qenriched categorical structures; they form a locally ordered category Ord(Q). The free-cocompletion KZ-doctrine on Ord(Q) has Mod(Q), the quantaloid of Q-modules, as category of Eilenberg-Moore algebras. In this paper we give an intrinsic description of the Kleisli algebras: we call them the locally principally generated Q-m...

While the worst case computational properties of Allen s calculus for qualitative temporal reasoning have been analyzed quite extensively the determination of the empirical e ciency of algorithms for solving the con sistency problem in this calculus has received only little research atten tion In this paper we will demonstrate that using the ORD Horn class in Ladkin and Reinefeld s backtracking...

The change in the state of the virus-induced enzyme associated with a mutation in the virus provides additional evidence that the enzyme is synthesized from virus rather than rabbit genetic information. This change in structure results in differences in stability of polymerization, degree of optical rotary dispersion (ORD) specific rotation, change in elution characteristics from carboxymethyl ...

We introduce a new subclass of Allen's interval algebra we call \ORD-Horn subclass," which is a strict superset of the \pointisable subclass." We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is suucient for deciding satissability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclas...

We present a new shape-coding approach, which decouples the shape information into two independent data sets, the skeleton and the distance of the boundary from the skeleton. The major benefit of this approach is that it allows a more flexible trade-off between accuracy of the approximation and bit-allocation cost, and thus, provides the possibility of better performance in the operational rate...