2912 search results - page 332 / 583 » Logistic Model Trees |
120
click to vote
JCO
2010
15 years 3 months ago
2010
Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth at most r. We are interested in determining whether G has a cu...
173
click to vote
EMNLP
2009
15 years 2 months ago
2009
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
142
Voted
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
161
Voted
ICCSA
2003
Springer
15 years 9 months ago
2003
Springer
—Recently, Bayesian probabilistic models have been used for predicting software development effort. One of the reasons for the interest in the use of Bayesian probabilistic model...
132
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...