Knowledge workers are often embedded in an organizational setting, where execution of processes allows for appropriate, context-sensitive support. When a knowledge worker starts a ...
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Ordering information is a difficult but a important task for natural language generation applications. A wrong order of information not only makes it difficult to understand, but a...
Abstract. This paper proposes an approach to improve statistical word alignment with ensemble methods. Two ensemble methods are investigated: bagging and cross-validation committee...
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...