Sciweavers

15375 search results - page 202 / 3075
» cans 2008
Sort
View
IPL
2007
130views more  IPL 2007»
13 years 8 months ago
Linear structure of bipartite permutation graphs and the longest path problem
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...
Ryuhei Uehara, Gabriel Valiente
IPL
2007
94views more  IPL 2007»
13 years 8 months ago
The finite horizon investor problem with a budget constraint
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 ...
Asaf Levin
TCS
2008
13 years 8 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
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 ...
Bin Li, Jiawang Nie, Lihong Zhi
IPM
2007
99views more  IPM 2007»
13 years 8 months ago
Older versions of the ROUGEeval summarization evaluation system were easier to fool
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...
Jonas Sjöbergh
TECS
2008
94views more  TECS 2008»
13 years 8 months ago
Composing heterogeneous reactive systems
elationships between heterogeneous models at different levels of abstraction. In particular, they can be used to represent design transformations from tightly synchronized specific...
Albert Benveniste, Benoît Caillaud, Luca P. ...