The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
We study a model that incorporates a budget constraint in a decision making problem. Our goal is to maximize the expected wealth, where in each time period we can either stop the ...
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
We show some limitations of the ROUGE evaluation method for automatic summarization. We present a method for automatic summarization based on a Markov model of the source text. By...
elationships between heterogeneous models at different levels of abstraction. In particular, they can be used to represent design transformations from tightly synchronized specific...