Sciweavers

2553 search results - page 161 / 511
» Modeling Trees with Hypertextures
Sort
View
148
Voted
ACL
2012
13 years 6 months ago
A Ranking-based Approach to Word Reordering for Statistical Machine Translation
Long distance word reordering is a major challenge in statistical machine translation research. Previous work has shown using source syntactic trees is an effective way to tackle ...
Nan Yang, Mu Li, Dongdong Zhang, Nenghai Yu
SIAMCOMP
2012
13 years 6 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
NAACL
2007
15 years 5 months ago
Tree Revision Learning for Dependency Parsing
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...
Giuseppe Attardi, Massimiliano Ciaramita
CN
2006
82views more  CN 2006»
15 years 3 months ago
Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks
In this study, we investigate a cost-effective approach for protecting several multicast sessions from any link failure in an optical network. The approach, referred to as cross-s...
Narendra K. Singhal, Canhui Ou, Biswanath Mukherje...
INFOCOM
1995
IEEE
15 years 7 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma