446 search results - page 30 / 90 » A Combinatorial Theorem for Trees |
100
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
ASIAN
2003
Springer
15 years 5 months ago
2003
Springer
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automated verification usually fails for functions with accumulating ar...
333
click to vote
RECOMB
2011
Springer
14 years 2 months ago
2011
Springer
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
138
click to vote
EMNLP
2007
15 years 1 months ago
2007
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...