1000 search results - page 95 / 200 » Dependency Tree Automata |
109
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
125
click to vote
4OR
2010
15 years 2 months ago
2010
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...
112
click to vote
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In traditional overlay multicast network, all peers are treated as equal regardless of their importance and contribution to the network. In this paper, we consider that each user ...
156
click to vote
EMNLP
2007
15 years 4 months ago
2007
Reordering model is important for the statistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global reordering...
147
click to vote
COCOA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...