Sciweavers

341 search results - page 36 / 69
» Paired bondage in trees
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
14 years 9 months ago
Reconstructing genome trees of prokaryotes using overlapping genes
Background: Overlapping genes (OGs) are defined as adjacent genes whose coding sequences overlap partially or entirely. In fact, they are ubiquitous in microbial genomes and more ...
Chih-Hsien Cheng, Chung-Han Yang, Hsien-Tai Chiu, ...
FOCS
2004
IEEE
15 years 1 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
LREC
2010
180views Education» more  LREC 2010»
14 years 11 months ago
A Comprehensive Resource to Evaluate Complex Open Domain Question Answering
We describe two corpora of question and answer pairs collected for complex, open-domain Question Answering (QA) to enable answer classification and re-ranking experiments. We deli...
Silvia Quarteroni, Alessandro Moschitti
DAM
2008
108views more  DAM 2008»
14 years 9 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
Cédric Bentz
COLING
2002
14 years 9 months ago
Learning Chinese Bracketing Knowledge Based on a Bilingual Language Model
This paper proposes a new method for automatic acquisition of Chinese bracketing knowledge from English-Chinese sentencealigned bilingual corpora. Bilingual sentence pairs are fir...
Yajuan Lü, Sheng Li, Tiejun Zhao, Muyun Yang