14518 search results - page 195 / 2904 » Two Problems for Sophistication |
94
Voted
ACL
2009
14 years 10 months ago
2009
We report in this paper our work on accurately generating case markers and suffixes in English-to-Hindi SMT. Hindi is a relatively free word-order language, and makes use of a com...
115
Voted
SIAMDM
1998
15 years 10 days ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
80
Voted
DCC
2006
IEEE
16 years 8 days ago
2006
IEEE
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
139
click to vote
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
90
Voted
HYBRID
2007
Springer
15 years 6 months ago
2007
Springer
The aim of this paper is twofold. On one hand we present an approach to the general problem of nonlinear control in the framework of (differentiable) groupoids, which, in our opin...