5699 search results - page 220 / 1140 » Alternating model trees |
202
Voted
ACL
2011
14 years 9 months ago
2011
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
174
Voted
ICC
2009
IEEE
16 years 27 days ago
2009
IEEE
— In this paper, we propose a game theoretical approach to tackle the problem of the distributed formation of the uplink tree structure among the relay stations (RSs) and their s...
188
click to vote
RP
2009
Springer
16 years 20 days ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
146
Voted
EMNLP
2008
15 years 7 months ago
2008
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...
153
Voted
ACL
2006
15 years 7 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...