The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
Object tracking in wireless sensor networks is to track mobile objects by scattered sensors. These sensors are typically organized into a tree to deliver report messages upon dete...