This paper introduces deep syntactic structures to syntax-based Statistical Machine Translation (SMT). We use a Head-driven Phrase Structure Grammar (HPSG) parser to obtain the de...
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
Zohreh Jabbari, William S. Evans, David G. Kirkpat...
This paper presents a translation model that is based on tree sequence alignment, where a tree sequence refers to a single sequence of subtrees that covers a phrase. The model lev...
Min Zhang, Hongfei Jiang, AiTi Aw, Haizhou Li, Che...
Interactive Cross-Language Information Retrieval (CLIR), a process in which searcher and system collaborate to find documents that satisfy an information need regardless of the la...
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...