We study games with reachability objectives under energy constraints. first prove that strict constraints (either only lower-bound constraint or interval constraint), those are LOGSPACE -equivalent to the same but without objective (i.e., for infinite runs). then consider two relaxations of upper-bound (while keeping strict): in one, called weak upper bound , is absorbing i.e., when reached, ex...

A common approach to automatic quad layout generation on surfaces is to, in a first stage, decide the positioning of irregular vertices, followed by finding sensible edges connecting these vertices and partitioning surface into quadrilateral patches second stage. While this two-step reduces problem's complexity, separation also limits result quality. In worst case, set fixed stage without consi...

In this paper, we present a discriminative word-character hybrid model for joint Chinese word segmentation and POS tagging. Our word-character hybrid model offers high performance since it can handle both known and unknown words. We describe our strategies that yield good balance for learning the characteristics of known and unknown words and propose an errordriven policy that delivers such bal...

We give an overview of the Theory of Relaxed Unification—a novel theory that extends the classical Theory of Unification. Classical unification requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can contain inconsistent information. Classical unification fails when the data is imperfect. We propose the Theory of Relaxed Unification as a new ...