720 search results - page 19 / 144 » Linear k-arboricities on trees |
162
click to vote
ICDCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree...
198
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
146
click to vote
ACL
2009
15 years 4 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
155
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B
187
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...