14 search results - page 3 / 3 » Polynomial Time Inference of a Subclass of Context-Free Tran... |
157
Voted
MST
2010
15 years 17 days ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
159
click to vote
IPCO
2010
15 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
181
click to vote
PPDP
2010
Springer
15 years 3 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
167
click to vote
RECOMB
1997
Springer
15 years 10 months ago
1997
Springer
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...