1105 search results - page 137 / 221 » Linear choosability of graphs |
152
click to vote
ECCC
2010
15 years 3 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...
139
click to vote
EMNLP
2010
15 years 2 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
165
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
123
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
146
click to vote
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...