This paper deals with the reference choices involved in the generation of argumentative text. Since a natual segmentation of discourse into attentional spaces is needed to carry out this task, this paper first proposes an architecture for natural language generation that combines hierarchical planning and focus-guided navigation, a work in its own right. While hierarchical planning spans out an...

Database design for data warehouses is based on the notion of the snowflake schema and its important special case, the star schema. The snowflake schema represents a dimensional model which is composed of a central fact table and a set of constituent dimension tables which can be further broken up into subdimension tables. We formalise the concept of a snowflake schema in terms of an acyclic da...

One of the challenges of Arabic speech recognition is to deal with the huge lexical variety. Morphological decomposition has been proposed to address this problem by increasing lexical coverage, thereby reducing errors that are due to words that are unknown to the system. In our previous attempts to develop an Arabic speech-to-text (STT) transcription system with morphological decomposition, an...

A structure-based approach to the solution of constraint problems (e.g., tree-based decomposition) typically assumes that knowledge about the problem remains static, and demands extensive resources to pursue the solution. This may explain why such an approach is sometimes infeasible on large-scale, real-world problems. This paper proposes a new approach, called composition that partitions a pro...

We present an algorithm that on input of an n×n symmetric diagonally dominant matrix A with m non-zero entries constructs in time Õ(m log n) a solver which on input of a vector b computes a vector x satisfying ||x−Ab||A < �||Ab||A in time Õ(m log n log(1/�)) 1. The new algorithm exploits previously unknown structural properties of the output of the incremental sparsification algorithm given in ...

In this paper, we investigate the problem of e cient querying large amount of linked data using Map-Reduce framework. We assume data graphs that are arbitrarily partitioned in the distributed file system. Our technique focuses on the decomposition of the query posed by the user, which is given in the form of a query graph into star subqueries. We propose a two-phase, scalable Map-Reduce algorit...

We give necessary and sufficient conditions for a resolvable H−decomposition of λKn in the case where H is one of the 10 graphs obtained by the union of two paths of length 2, with two possible exceptions. In particular, we complete the 4-star ( r r r rr ) and T ( r r r rr ) for higher lambda and give complete solutions for resovable decompositions into Fish ( r r rr ), Mulinetto ( r r r r) and...

In this paper we consider dynamical r-matrices over a nonabelian base. There are two main results. We first give a geometric construction of a non-degenerate triangular dynamical rmatrix from a fat reductive decomposition g = h⊕m using symplectic fibrations. We also prove that a triangular dynamical r-matrix r : h∗ −→ ∧g corresponds to a Poisson manifold h∗ ×G. A special type of quantizations o...

This paper describes a simple and robust method for improving the runtime of likelihood computation on multi-core processors without degrading system accuracy. The method improves runtime by parallelizing likelihood computations on a multi-core processor. Mixtures are decomposed among the cores and each core computes the likelihood of the mixture allocated to it. We study two approaches to mixt...