Sciweavers

495 search results - page 51 / 99
» Probability Trees
Sort
View
RECOMB
2006
Springer
14 years 9 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
JCAMD
2010
82views more  JCAMD 2010»
13 years 7 months ago
Making priors a priority
When we build a predictive model of a drug property we rigorously assess its predictive accuracy, but we are rarely able to address the most important question, “How useful will...
Matthew Segall, Andrew Chadwick
AAAI
2007
13 years 11 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
EMNLP
2006
13 years 10 months ago
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the pro...
Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsur...
COLING
2010
13 years 3 months ago
Effective Constituent Projection across Languages
We describe an effective constituent projection strategy, where constituent projection is performed on the basis of dependency projection. Especially, a novel measurement is propo...
Wenbin Jiang, Yajuan Lv, Yang Liu, Qun Liu